NP-overrated(gruhn.me)
242 points by theanonymousone 8 days ago | 177 comments
tl;dr: NP-hard problems are widely misunderstood as intractable, but in practice worst cases rarely occur and modern solvers routinely find provably optimal solutions—Amazon reportedly solves a billion SMT problems daily. Algorithmic improvements have outpaced hardware gains, with one paper citing a 450-billion-fold speedup between 1991 and 2015. When worst cases do hit, engineers can handle them the same way they handle slow HTTP requests: timeouts and error messages.
HN Discussion:
  • Complexity theory serves theoretical understanding, not practical guidance, so calling it overrated misses the point
  • Real-world problem structure allows NP-hard problems to be solved or approximated effectively in practice
  • ~The article underplays that the main solution is avoiding or constraining the hard cases rather than solving them
  • Type checking is a poor example because worst-case blowups actually do occur regularly in practice
  • Personal anecdote confirming that non-scaling solutions work fine when n stays small