Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the concept of NP in computational complexity theory through this undergraduate lecture from Carnegie Mellon University's Course 15-455. Delve into stronger conjectures, brute force algorithms, and the key features of NP problems. Learn about verification processes for the Yes Case and examine specific examples like Squares and Colors proofs. Gain insights from Professor Ryan O'Donnell's expertise in this comprehensive 81-minute session, which aligns with Sipser Ch. 7.3 (excluding nondeterminism).
