Search 6,000+ CA Community College Courses
Undergrad Complexity at CMU - Hardness within P

Undergrad Complexity at CMU - Hardness within P

Ryan O'Donnell via YouTube Direct link

Finegrained complexity

8 of 12
Previous
Next

8 of 12

Finegrained complexity

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Undergrad Complexity at CMU - Hardness within P

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction
  2. 2 Time Hierarchy Theorem
  3. 3 Strong Exponential Time Hypothesis
  4. 4 All pairs shortest paths
  5. 5 K clique problem
  6. 6 Contextfree grammar parsing
  7. 7 New hardness results
  8. 8 Finegrained complexity
  9. 9 Reductions
  10. 10 Contrapositive
  11. 11 Reduction algorithms
  12. 12 Open Question

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.