# OpenAI model reportedly finds 3SAT subexponential-time algorithm

> Original title: 3SAT in subexponential time (2^{n / log^eps(n)}) is maybe the biggest surprise I have seen during my 20 years following theoretical compu...

- Source: Sebastien Bubeck
- Published: 2026-10-26T21:55:15.000Z
- Bad Influence: https://badinfluence.news/items/uzesg5fw47hkvorowpkyntcuj
- Original: https://x.com/SebastienBubeck/status/2114838293330420187

## Summary

Sebastien Bubeck calls a result placing 3SAT in subexponential time, 2^{n / log^eps(n)}, one of the biggest surprises of his 20 years following theoretical computer science. The post is a reaction to a Dan Roberts announcement of three new discoveries in mathematics, computer science, and physics, linked to an OpenAI page on building scientific understanding with academic communities.

## Post

3SAT in subexponential time (2^{n / log^eps(n)}) is maybe the biggest surprise I have seen during my 20 years following theoretical computer science (still remember the feeling 25 years ago seeing the diff a 3 versus a 2 can make for complexity 😅)

## Quoted post @danintheory

> We are announcing three new discoveries in mathematics, computer science, and physics about harmonic analysis, complexity theory, and quantum field theory.
> 
> https://openai.com/index/building-scientific-understanding-with-academic-communities/

https://x.com/danintheory/status/2114833682469122314