Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay 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
-
Inverse Quadratic Decay in Random Subset Sum
Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay in linearithmic time.