Advanced
Data Structures & Algorithms
Q95 / 100
What is the difference between NP-hard and NP-complete?
Correct! Well done.
Incorrect.
The correct answer is B) NP-hard is at least as hard as NP problems; NP-complete is NP-hard AND in NP (verifiable in polynomial time)
B
Correct Answer
NP-hard is at least as hard as NP problems; NP-complete is NP-hard AND in NP (verifiable in polynomial time)
Explanation
NP-hard: at least as hard as hardest NP problems (may not be in NP). NP-complete: NP-hard AND in NP. Halting problem is NP-hard but not NP-complete (undecidable).
Progress
95/100