Topic
computational complexity
Stories
Stage · Developing3 sourcesTech
OpenAI says its model refuted ETH, a 1999 hypothesis behind hundreds of papers
OpenAI said on Oct. 26 that an internal model found a disproof of the Exponential Time Hypothesis (ETH), an assumption about how hard Boolean satisfiability problems are that hundreds of computer science papers build on.
Stage · Developing4 sourcesTech
Hundreds of papers assume ETH. OpenAI says its model disproved it; checks have just begun
OpenAI's model found a claimed disproof of the Exponential Time Hypothesis (ETH) on 16 October, and the company checked it in the Lean proof language the next day, per The Next Web.