Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
Afrouz Jabal Ameli, Jesper Nederlof, Shengzhe Wang
We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings. In particular, there is an algorithm for the Traveling Salesperson Problem…
cs.DS2026
An Invitation to "Fine-grained Complexity of NP-Complete Problems"
Jesper Nederlof
Assuming that P is not equal to NP, the worst-case run time of any algorithm solving an NP-complete problem must be super-polynomial. But what is the fastest run time we can get? B…