A new mathematical proof claims to disprove the Exponential Time Hypothesis (ETH), a central conjecture in computational complexity theory. The result, discussed on Hacker News, suggests that certain problems long believed to require exponential time may instead admit faster, sub-exponential algorithms.
The post, which has drawn 397 points and 149 comments, links to a PDF detailing the proof. ETH posits that 3-SAT and related problems cannot be solved in sub-exponential time; if verified, the disproof would reshape understanding of computational hardness.
Commenters debated the proof's rigor, with some urging caution until peer review. Others noted implications for cryptography and algorithm design. The discussion also referenced three new discoveries across mathematics, computer science, and physics.
While excitement builds, experts emphasize that formal verification is pending. The proof, if correct, could impact complexity theory, parameterized computation, and theoretical computer science broadly.
See also: Announcing three new discoveries in mathematics, computer science, and physics.
Source: Hacker News · Summarized by HeadlinesBriefing