Randomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit @RyanODonnellTeaching
Randomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded July 2020 | Updated November 2026, 52 minutes ago
The more interesting kind of communication complexity: randomized. The randomized communication of equality, and Newman's Theorem on public vs. private coins.

Lecture 23c 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/)
Randomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit#72/100: Ops on separate qubits: order doesnt matter || Quantum Computer Prog. in 100 Easy Lessons#46/100: Discriminating 2 qubits, multiple copies | Quantum Computer Programming in 100 Easy LessonsSpectral Graph Theory: The Standard Random Walk || @ CMU || Lecture 13b of CS Theory Toolkit#81/100: Rotation Estimation: different settings || Quantum Computer Programming in 100 Easy Lessons#51/100: The Elitzur-Vaidman Glitter Bomb || Quantum Computer Programming in 100 Easy Lessons#9/100: Superposition-creating instructions || Quantum Computer Programming in 100 Easy LessonsFourier, Decision Trees, Learning Algorithms || @ CMU || Recitation 5 of CS Theory Toolkit#68/100: Measuring/deleting one qubit of several || Quantum Computer Programming in 100 Easy LessonsSpectral Graph Theory: the Markov transition operator || @ CMU || Lecture 14a of CS Theory Toolkit#29/100: Quantum Bias-Busting (Deutsch Jozsa) || Quantum Computer Programming in 100 Easy Lessons#32/100: Correlation || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Randomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER