latest news in computational complexity
OpenAI Challenges Decades of Computer Science by Refuting Foundational Complexity Rule
San Francisco, Tuesday, 27 October 2026.
OpenAI announced its artificial intelligence disproved the longstanding Exponential Time Hypothesis, publishing machine-verified proofs that suggest complex computational problems may be solved significantly faster than previously assumed possible.