Technology term
Exponential Time Hypothesis (ETH)
A conjecture in computational complexity stating, roughly, that satisfiability for formulas such as 3-SAT cannot be solved in subexponential time as the number of variables grows. Many conditional hardness results rely on it, so a valid refutation would affect conclusions across algorithms and complexity theory.
English
Exponential Time Hypothesis
Arabic
فرضية الزمن الأسي
First appeared in
OpenAI Says Its AI Broke Three Scientific Barriers. Verification Has Just Begun
