Is NP-Complete Harder to Solve than NP-Hard?

[jetoso]

I have a question. Is the class of problems NP-Complete more difficult to solve than the class of problems NP-Hard?

I mean, NP-Complete problems are in NP, and also are NP-Hard, but not all NP-Hard problems are in NP... How to tell which one is more difficult to solve?

 

[NateTG]

The set of problems that are NP-hard is a strict superset of the problems that are NP-complete. Some problems (like the halting problem) are NP-hard, but not in NP.

 

[CRGreathouse]

NP-Hard problems that are not NP-Complete are 'harder' than NP problems, in general, in that they take up more computational resources of some type: memory, time, alternation, randomness, etc.

 

[0rthodontist]

Or as Nate mentioned, NP-hard problems might be impossible to solve in general. You can tell the difference in difficulty between NP-hard and NP-complete problems because the class NP includes everything easier than its "toughest" problems--if a problem is not in NP, it is harder than all the problems in NP.

By the way, would you post things like this in the future in the Programming forum, as it is a computer science question?