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

YouTube

IP = PSPACE - Graduate Complexity Lecture at CMU

Ryan O'Donnell via YouTube

Start learning Write review
Coursera Ad

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

Learn More → CodeSignal Ad

Learn the Skills Netflix, Meta, and Capital One Actually Hire For

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate lecture explains the theorem IP = PSPACE, focusing on interactive proof systems, Merlin–Arthur protocols, polynomial methods, and the relationship between randomness, interaction, and computational complexity.

Syllabus

Introduction
General Scenario
Interactive Proof Systems
Going My Prime
Interactive Proof
Protocol
Univariate polynomial
Motivation
Merlin
Arthur
Interlude
Sharp P
Instance checkers
Interactive proofs vs instance checkers
Merlin as an Oracle

Taught by

Ryan O'Donnell

Reviews

Start your review of IP = PSPACE - Graduate Complexity Lecture at CMU

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.