- #1
jetoso
- 73
- 0
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?
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?