Undergrad Complexity at CMU - Problems in P

Undergrad Complexity at CMU - Problems in P

Ryan O'Donnell via YouTube Direct link

Time Hierarchy Theorem

1 of 16

1 of 16

Time Hierarchy Theorem

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Undergrad Complexity at CMU - Problems in P

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Time Hierarchy Theorem
  2. 2 New Complexity Class
  3. 3 What is P
  4. 4 Natural problems
  5. 5 Goal of computer science
  6. 6 Bruteforce algorithms
  7. 7 Problems in P
  8. 8 Running time
  9. 9 Paths
  10. 10 Breadthfirst search
  11. 11 Two coloring
  12. 12 Two coloring algorithm
  13. 13 Three coloring algorithm
  14. 14 Longest common subsequence
  15. 15 Brute force solution
  16. 16 Recursion

Never Stop Learning.

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

Someone learning on their laptop while sitting on the floor.