Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Undergrad Complexity at CMU - Why is P vs. NP Difficult?

Ryan O'Donnell via YouTube

Start learning Write review
DataCamp Ad

AI Engineer - Learn how to integrate AI into software applications

Learn More → Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture examines why the P versus NP problem is difficult to resolve, focusing on negative results, Ladner's theorem, simulations, and proof barriers in computational complexity theory.

Syllabus

Intro
Negative results
Ladners theorem
Simulations
P vs NP
Algorithm A
Proof
The Idea
The Proof
Design B

Taught by

Ryan O'Donnell

Reviews

Start your review of Undergrad Complexity at CMU - Why is P vs. NP Difficult?

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.