Co-NP

Co-NP stands for the complement of NP Class. It means if the answer to a problem in Co-NP is No, then there is proof that can be checked in polynomial time.

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