Exponential Time Hypothesis: How the OpenAI Proof Breaks the 3-SAT Barrier
A formula with a million Boolean variables has more possible assignments than any computer could enumerate. The exponential time hypothesis says that, for worst-case 3-SAT, an exponential dependence on the variable count cannot be escaped. OpenAI’s October 25, 2026 manuscript presents an escape: deterministic, exact counting in subexponential time and polynomial space for every fixed … Read more