Search 6,000+ CA Community College Courses
Undergrad Complexity at CMU - Why is P vs. NP Difficult?

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

Ryan O'Donnell via YouTube Direct link

Algorithm A

6 of 10
Previous
Next

6 of 10

Algorithm A

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

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

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 Negative results
  3. 3 Ladners theorem
  4. 4 Simulations
  5. 5 P vs NP
  6. 6 Algorithm A
  7. 7 Proof
  8. 8 The Idea
  9. 9 The Proof
  10. 10 Design B

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.