Subexponential Hamiltonian Cycle Algorithm Built on ETH Refutation

Building on OpenAI and Anthropic's recent refutation of the Exponential Time Hypothesis, a researcher derived and Lean-verified a deterministic subexponential algorithm for exactly counting Hamiltonian cycles in O(n)-edge graphs.

2026-10-28 ~ 2026-10-28 · 3 related posts

• Hamiltonian cycles become subexponentially countable, assuming the new ETH refutations hold — xennygrimmato_ · 2026-10-28
• Subexponential Hamiltonian cycle counting derived from OpenAI/Anthropic ETH refutations, verified in Lean — xennygrimmato_ · 2026-10-28
• Claimed ETH refutations yield first sub-exponential algorithm counting Hamiltonian cycles — xennygrimmato_ · 2026-10-28