Skip to content
View original post on X: Deedy
Published
62/100

OpenAI and Anthropic models independently break the Exponential Time Hypothesis for 3-SAT

AIDeedy says OpenAI and Anthropic models independently solved 3-SAT with the same 2^(n/√log n) bound on October 16, undermining the 27-year-old Exponential Time Hypothesis. The author states the result does not prove P = NP but is faster than expected.
DeedyVerified on X
@deedydas
View on X

Exponential Time Hypothesis (ETH), a 27-year-old conjecture in complexity theory, just fell.

On Oct 16, OpenAI and Anthropic models independently solved 3-SAT with the same 2^(n/√log n) bound. Not P = NP, but faster than anyone thought possible.

We live in extraordinary times.

Source details

Deedy · x.comPublished · added here

Original title: Exponential Time Hypothesis (ETH), a 27-year-old conjecture in complexity theory, just fell.

Topics

OpenAI / ChatGPTAnthropic / ClaudeReasoningPapers & research