Achieves TSP space-time tradeoff with ST < 3.572 using sparse set systems admitting many maximal chains, improving prior minimum of ~3.93 and disproving a 2013 conjecture.
A t=o(2n/2), s=o(2n/4) algorithm for certain np-complete problems.SIAM J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Improved space-time tradeoff for TSP via extremal set systems
Achieves TSP space-time tradeoff with ST < 3.572 using sparse set systems admitting many maximal chains, improving prior minimum of ~3.93 and disproving a 2013 conjecture.
-
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.