Exponential Time Hypothesis (ETH)
A central hypothesis in computational complexity theory asserting that the 3SAT problem admits no subexponential-time algorithm, that is, its complexity lower bound is at least 2^{Ω(n)}.
Core Facts
Timeline (last 90 days)
OpenAI says its system proved that the Exponential Time Hypothesis (ETH) is false.
OpenAI published a mathematical proof that reportedly overturns the Exponential Time Hypothesis (ETH).
OpenAI's proof gives an upper bound on algorithm complexity of the form 2^n / sqrt(log n); this function falls in the subexponential regime and contradicts the assertion of ETH.
Overturning ETH does not directly imply P=NP, but it removes an important theoretical obstacle.
P≠NP and the Exponential Time Hypothesis (ETH) are unproven assumptions in complexity theory that serve as the inferential foundation for many conclusions.
The Exponential Time Hypothesis (ETH) was proposed by Impagliazzo and Paturi in 1999.
All Facts (6)
The Exponential Time Hypothesis (ETH) was proposed by Impagliazzo and Paturi in 1999.
80%UnverifiedOpenAI says its system proved that the Exponential Time Hypothesis (ETH) is false.
50%UnverifiedOpenAI's proof gives an upper bound on algorithm complexity of the form 2^n / sqrt(log n); this function falls in the subexponential regime and contradicts the assertion of ETH.
50%UnverifiedOverturning ETH does not directly imply P=NP, but it removes an important theoretical obstacle.
50%UnverifiedP≠NP and the Exponential Time Hypothesis (ETH) are unproven assumptions in complexity theory that serve as the inferential foundation for many conclusions.
50%UnverifiedOpenAI published a mathematical proof that reportedly overturns the Exponential Time Hypothesis (ETH).
50%