The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2representative citing papers
citing papers explorer
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
- Deterministic Monotone Min-Plus Product and Convolution