InAdvances in Cryptology – ASIACRYPT 2020 (Lecture Notes in Computer Science, Vol

Improved Classical, Quantum Algorithms for Subset-Sum · 2020 · DOI 10.1007/978-3-030-64834-3_22

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-05-06 · unverdicted · novelty 6.0 · 2 refs

Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay in linearithmic time.

Showing 1 of 1 citing paper.

Inverse Quadratic Decay in Random Subset Sum cs.DS · 2026-05-06 · unverdicted · none · ref 4 · 2 links
Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay in linearithmic time.