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 😅)
OpenAI model reportedly finds 3SAT subexponential-time algorithm
AISebastien 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.
Sebastien BubeckVerified on X
@SebastienBubeck
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/View quoted post on X
Source details
Sebastien Bubeck · x.comPublished
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...