NP-Hard

An NP-hard problem is at least as hard as the hardest problem in NP and it is the class of the problems such that every problem in NP reduces to NP-hard.

Visit the following resources to learn more:

• @article@Trying to understand P vs NP vs NP Complete vs NP Hard
• @video@Complexity: P, NP, NP-completeness, Reductions
• @video@Complexity: Approximation Algorithms
• @video@Complexity: Fixed-Parameter Algorithms
• @video@Lecture 23: Computational Complexity
• @video@Greedy Algs. II & Intro to NP Completeness
• @video@NP Completeness II & Reductions
• @video@NP Completeness III
• @video@NP Completeness IV