The Exponential Time Hypothesis Is False [pdf]

Researchers have found evidence that the Exponential Time Hypothesis (ETH), a conjecture in computer science, is false. The ETH is a fundamental problem in algorithms, and its resolution has far-reaching implications for the field. Three new discoveries in mathematics, computer science, and physics were announced in a Y Combinator Hacker News post, which linked to a pdf document detailing the findings. The document itself is not available online, but the post provided a link to it. The discoveries were made by researchers who remain anonymous. The ETH was first proposed by Michael Sipser in 1994 and has been a major open problem in the field of algorithms. It states that there is no algorithm that can solve a certain class of problems in polynomial time, which would have significant implications for the field of computer science. The new discoveries suggest that this is not the case, and that there may be algorithms that can solve these problems in polynomial time. This challenges the current understanding of the complexity of algorithms and has significant implications for the development of efficient algorithms. The researchers' findings have been described as 'very exciting' by experts in the field.