Deterministic Monotone Min-Plus Product in O(n^{2.686}) time matching the randomized bound and derandomizing applications including Language Edit Distance and RNA Folding.
Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
citing papers explorer
-
Deterministic Monotone Min-Plus Product and Convolution
Deterministic Monotone Min-Plus Product in O(n^{2.686}) time matching the randomized bound and derandomizing applications including Language Edit Distance and RNA Folding.
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.