A meshing and beam search algorithm for random subset sum achieves inverse quadratic error decay O(B/(n w^2)) under a mean-field assumption while running in linearithmic time.
Comput.48, 2 (2019), 539–579
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Robust Inverse Quadratic Error Decay with Meshing and Beam Search for Random Subset Sum
A meshing and beam search algorithm for random subset sum achieves inverse quadratic error decay O(B/(n w^2)) under a mean-field assumption while running in linearithmic time.