Why OpenAI's complexity result matters: some NP problems may beat exponential time
jfischoff · x · 2026-10-27
Commentary on OpenAI's complexity theory result: OpenAI didn't prove P=NP, but showed that some NP-complete problems can be solved faster than exponential time. This implies either P=NP, or NP problems sit at a "middle" complexity between polynomial and exponential, e.g. O(n^log n). If it survives peer review, it could be one of the biggest CS breakthroughs in decades.
More from Research
- General Physics Transformer shows foundation-model paradigm works for physics simulation — burny_tech · 2026-10-27
- Kimi Team proposes Attention Residuals, replacing fixed residual accumulation with learned attention — burny_tech · 2026-10-27
- Early reproduction of Kimi's Attention Residuals in a physics transformer shows faster convergence — burny_tech · 2026-10-27
- ETH reviewers say OpenAI's claimed disproof shouldn't be read as certified — fortnow · 2026-10-27
- OpenAI claims Exponential Time Hypothesis is false, solving 3SAT in subexponential time — fortnow · 2026-10-27
- Two open checkpoints show a full JEPA-pretrain-to-GRPO RL recipe on small LLMs — burny_tech · 2026-10-27