Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This undergraduate lecture introduces NP through satisfiability, polynomial-time verification, NP features, and examples including squares and graph coloring. It also discusses the relationship between NP, polynomial-time algorithms, and the P versus NP question.
