Summary
Two Minute Papers covers a claim from OpenAI that could reshape theoretical computer science: a research paper asserting that the exponential time hypothesis is false. The hypothesis holds that problems like 3-satisfiability, in the worst case, require exponentially growing time as they get larger, and that no general algorithm can beat that barrier.
The video explains 3-SAT with a simple example of cats, dogs, and dancing robots, then shows why it matters beyond logic puzzles. Through Karp reductions, many hard problems, including delivery routing, radio frequency assignment, sensor placement, and spacecraft payload selection, can be recast as 3-SAT. A faster algorithm for one could therefore help with many others.
According to the video, the paper does not merely argue that a sub-exponential algorithm exists. It supplies the algorithm itself, and the method also reports how many solutions a problem has. The presenter stresses that expert review is not complete, though the proof looks increasingly convincing, and clarifies that this is not a resolution of the P versus NP question. The video is a quick, accessible introduction to what the claim means if it holds up.
📺 Source: Two Minute Papers · Published October 30, 2026
🏷️ Format: News Analysis
