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":
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.
[ Parent
| on HN ]
There are no comments on this comment yet.