Yaos Minimax Theorem & IP_2s Communication Complexity || @ CMU || Lecture 23d of CS Theory Toolkit @RyanODonnellTeaching
Yaos Minimax Theorem & IP_2s Communication Complexity || @ CMU || Lecture 23d of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded July 2020 | Updated November 2026, 19 hours ago
Herein: the statement of Yao's Minimax Theorem, the main tool for proving randomized communication complexity lower bounds; and, using this and Fourier analysis of Boolean functions to show that the randomized communication complexity of the inner-product-mod-2 function is linear.

Lecture 23d of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
"Communication Complexity", book by Kushilevitz and Mansour
"Communication Complexity and Applications", book by Rao and Yehudayoff

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Yaos Minimax Theorem & IP_2s Communication Complexity || @ CMU || Lecture 23d of CS Theory Toolkit#22/100: CCode → QCode, the general spec || Quantum Computer Programming in 100 Easy Lessons#96/100: Factoring finally finished! || Quantum Computer Programming in 100 Easy LessonsLearning About Quantum States 3:  Very Balanced or Very Rigged?Statement of the PCP Theorem || @ CMU || Lecture 27a of CS Theory Toolkit#36/100: Toggle and Hadamard are reflections || Quantum Computer Programming in 100 Easy Lessons#90/100: Verifying the first SW vector properties | Quantum Computer Programming in 100 Easy LessonsETH False II: completing the proofPseudorandom Generators || @ CMU || Lecture 12a of CS Theory ToolkitImproved Quantum Data Analysis (Shadow Tomography)Learning About Quantum States 4:  The Schur Weyl Distribution#66/100: Factoring via Rotation Estimation: plan || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Yao's Minimax Theorem & IP_2's Communication Complexity || @ CMU || Lecture 23d of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER