[enitihas]

This is an over simplification, but since the np hard problems are reducible to each other, finding polynomial time solution for one problem will give us polynomial time solutions for all np hard problems.

[jagraff]

NP complete, not NP hard