[username223]

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.