OpenAI PDF claims refutation of ETH, solving 3SAT in exp(n/(log n)^(1/2+o(1)))
rrwilliams · x · 2026-10-27
rrwilliams links to an OpenAI PDF claiming a refutation of the Exponential Time Hypothesis, asserting that 3SAT on n variables is solvable in about exp(n/(log n)^(1/2+o(1))) time. If verified, it would undermine many complexity lower bounds based on ETH; the claim awaits scrutiny by the theory community.
More from Research
- Rerunning Gemini 4 Argon with Antigravity harness lifts FrontierCS 2 score ~15% — vitaliychiley · 2026-10-27
- AI agent autonomously discovers and implements high-order Maxwell solver scheme — burny_tech · 2026-10-27
- OpenAI claims its AI invented a new math technique, cracking a 35-year-old wave-focusing problem — 141_1337 · 2026-10-27
- Penn's Kording Lab opens nominations for Spring 2027 speaker series — KordingLab · 2026-10-27
- neuron-explorer adds MLX backend for per-neuron steering on Apple Silicon — arthurcolle · 2026-10-27
- OpenAI says its models produced a Yang-Mills existence proof, formalized in Lean — exophades · 2026-10-27