NP Complete

A problem is NP-complete if it is both NP and NP-hard. NP-complete problems are the hard problems in NP.

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@P vs. NP and the Computational Complexity Zoo
• @video@Greedy Algs. II & Intro to NP Completeness
• @video@NP Completeness II & Reductions
• @video@NP Completeness III
• @video@NP Completeness IV