OpenAI claims Exponential Time Hypothesis is false, solving 3SAT in subexponential time
fortnow · x · 2026-10-27
OpenAI announced a stunning complexity theory result: it claims the Exponential Time Hypothesis (ETH) is false, with an algorithm solving 3SAT — including counting the number of solutions — in 2^{o(n)} time, accompanied by a Lean formalization of the proof. If verified, this would upend decades of assumptions underlying hardness results across theoretical computer science, implying subexponential algorithms for a vast class of NP problems. Currently this is OpenAI's own claim; independent verification is pending.
More from Models
- Nemotron-3.5 Bolt hits 9B active params, within 1% of Super on agentic benchmark — ryanshrout · 2026-10-27
- Cohere Accused of Spreading FUD About Chinese Models — voooooogel · 2026-10-27
- Steering two neurons turns Qwen3.5 4B into "evil qwen" — here's the math — burny_tech · 2026-10-27
- Opus 3's origin story survives repeated context compactions, seam after seam — repligate · 2026-10-27
- Human-written essay flagged as Mixed by AI detector Pangram in blogger's test — Aizkmusic · 2026-10-27
- AI community buzzes: Artificial Analysis hints a major release is imminent — rand_longevity · 2026-10-27