The Exponential Time Hypothesis Is False [pdf](github.com)
667 points by vok 14 hours ago | 250 comments
tl;dr: Summary not available
HN Discussion:
  • ↑Historical/contextual reflection on how CS intuitions about algorithmic complexity have evolved
  • ↑Clarification that the result is amazing but doesn't imply NP is subexponential or resolve P-vs-NP
  • •Noting an independent parallel proof from Anthropic with similar bounds
  • •Curiosity about practical implications for SAT solving and other areas like self-attention
  • ~Skepticism or confusion about the scaling and interpretation of the complexity bound shown