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.
The Switching Lemma - PRST Version - Graduate Complexity Lecture at CMU
Overview
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
Related Courses
-
Hopcroft-Paul-Valiant Theorem - Graduate Complexity Lecture at CMU
-
Approximate Counting - Graduate Complexity Lecture at CMU
-
IP = PSPACE - Graduate Complexity Lecture at CMU
-
Undergrad Complexity at CMU - Why is P vs. NP Difficult?
-
Time-Space Tradeoffs for SAT - Graduate Complexity Lecture at CMU
-
Undergrad Complexity at CMU - NP
