The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
Improved Approximation Schemes for ( Un- ) Bounded Subset-Sum and Partition , December 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.