The Exponential Time Hypothesis Is False [pdf]
A recent arXiv paper claims to refute the Exponential Time Hypothesis, which states that problems like 3‑SAT cannot be solved faster than exponential time. The authors propose an algorithm that solves 3‑SAT in sub‑exponential time, challenging a core assumption in complexity theory. The claim has prompted scrutiny from researchers evaluating its validity and implications for cryptography and algorithm design.