BloomTech’s Downfall: A Long Time Coming

Undergrad Complexity at CMU - From P-Completeness to PSPACE-Completeness

Undergrad Complexity at CMU - From P-Completeness to PSPACE-Completeness

Ryan O'Donnell via YouTube Direct link

Introduction

1 of 7
Next

1 of 7

Introduction

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Undergrad Complexity at CMU - From P-Completeness to PSPACE-Completeness

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction
  2. 2 PCompleteness
  3. 3 Reductions
  4. 4 Clauses
  5. 5 Logspace
  6. 6 Cooklevin Theorem
  7. 7 PSPACEComplete

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.