Hamiltonian cycles become subexponentially countable, assuming the new ETH refutations hold
xennygrimmato_ · x · 2026-10-28
A researcher announces that, assuming the newly claimed ETH refutations hold, the number of Hamiltonian cycles in an n-vertex graph with O(n) edges can be computed exactly and deterministically in subexponential time. Previously the best algorithms for general sparse graphs were exponential. The underlying premise is still pending expert review.
Related event: Subexponential Hamiltonian Cycle Algorithm Built on ETH Refutation(3 posts)→
More from Research
- OpenSIR: a self-play framework lets LLMs teach themselves math with zero training data — PMinervini · 2026-10-28
- Mechanistic interp as a meme: poking the neurons that make Qwen 'go homicidal' — sebkrier · 2026-10-28
- Open-source agent memory layer Mind hits 86.67% on LongMemEval without embeddings — GabrielMartinMoran · 2026-10-28
- Proposal: a public challenge to find the shortest prompt reproducing each arXiv paper's results — tak3sh8 · 2026-10-28
- Piano2Pop expands piano demos into full pop productions without aligned supervision — affige_yang · 2026-10-28
- RAX lets a real robot explore for 2 hours and turn learned skills into reusable code — no demos needed — du_yilun · 2026-10-28