Re:Graph Isomorphism Algorithm Breaks 30-Year Impasse
by username223 on Tuesday December 15, 2015 @08:15PM
(#10741721)
This. MJD has a great bit on blanket statements about "NP-complete means hard":
http://perl.plover.com/yak/12views/samples/notes.html#sl-24
Basically, you can often either settle for slightly suboptimal solutions, or ignore a few pathological worst cases. That said, I suspect that P != NP, and thought this was a good article.
I find these kinds of assertions somewhat misleading. There _are_ "efficient" algorithms for, one could say, "pragmatic variations" of NP-complete problems. Some only work on some subset of cases (perhaps most of the useful ones), or non-deterministic (but you run them enough times and get the right answer), etc.