SyntaxFix
Write A Post
Hire A Developer
Questions
As I understand it, an np-hard problem is not "harder" than an np-complete problem. In fact, by definition, every np-complete problem is:
-- Intro. to Algorithms (3ed) by Cormen, Leiserson, Rivest, and Stein, pg 1069