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

YouTube

The Switching Lemma - PRST Version - Graduate Complexity Lecture at CMU

Ryan O'Donnell via YouTube

Overview

Explore the Switching Lemma in this graduate-level Computational Complexity Theory lecture from Carnegie Mellon University. Delve into the PRST version of the lemma, covering topics such as the warmup theorem, PRST vs DNF, decision trees, and probability exercises. Gain insights from Professor Ryan O'Donnell's expertise as he guides you through proofs, experiments, and mathematical concepts like random variables and geometric series. Enhance your understanding of advanced complexity theory and its applications in computer science.

Syllabus

Introduction
Warmup theorem
Proof
Experiment
PRST vs DNF
W Clip Decision Tree
PRST Theorem
Decision Tree
Probability Exercise
Random Variables
Geometric Series
Final probability bound

Taught by

Ryan O'Donnell

Reviews

Start your review of The Switching Lemma - PRST Version - Graduate Complexity Lecture at CMU

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.