TSP on N vertices admits a space-time product S·T ≤ 3.1861^N via high chain-efficiency set systems, improving 3.9271^N and disproving a Johnson–Leader–Russell conjecture.
Title resolution pending
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
-
Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
TSP on N vertices admits a space-time product S·T ≤ 3.1861^N via high chain-efficiency set systems, improving 3.9271^N and disproving a Johnson–Leader–Russell conjecture.