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

YouTube

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

Ryan O'Donnell via YouTube

Start learning Write review
Coursera Ad

AI, Data Science & Cloud Certificates from Google, IBM & Meta

Learn More → Corporate Finance Institute Ad

Build the Finance Skills That Lead to Promotions, Not Just Certificates

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This undergraduate lecture examines complete problems for P and PSPACE using log-space reductions. It covers circuit evaluation, the Cook–Levin theorem, and quantified Boolean formulas, including TQBF.

Syllabus

Introduction
PCompleteness
Reductions
Clauses
Logspace
Cooklevin Theorem
PSPACEComplete

Taught by

Ryan O'Donnell

Reviews

Start your review of Undergrad Complexity at CMU - From P-Completeness to PSPACE-Completeness

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.