Optimal Chain Density and Space-Time Tradeoffs for the TSP
Prior state unknown→proved
The authors describe the tradeoff as nearly settled rather than settled.
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimization / Extremal Set Theory, Algorithms
Optimal Chain Density and Space-Time Tradeoffs for the TSP
The paper nearly settles the tradeoff between the size of a set system over $[n]$ and its number of full chains, an extremal question raised by Johnson, Leader and Russell as a counterpart to Sperner-type results, and linked by recent work to the space and time complexity of Bellman–Held–Karp dynamic programming for permutation problems.
15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
The paper nearly settles the tradeoff between the size of a set system over $[n]$ and its number of full chains, an extremal question raised by Johnson, Leader and Russell as a counterpart to Sperner-type results, and linked by recent work to the space and time complexity of Bellman–Held–Karp dynamic programming for permutation problems.
The authors describe the tradeoff as nearly settled rather than settled.
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.