Basics of Communication Complexity || @ CMU || Lecture 23a of CS Theory Toolkit @RyanODonnellTeaching
Basics of Communication Complexity || @ CMU || Lecture 23a of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 2 hours ago
Basic definitions and examples (Equality, Disjointness, Inner-Product-mod-2) for communication complexity. Lecture 23a 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/)
Basics of Communication Complexity || @ CMU || Lecture 23a of CS Theory Toolkit#15/100: Hadamard is unitary... || Quantum Computer Programming in 100 Easy Lessons#94/100: Equal superposition of steering wheels || Quantum Computer Programming in 100 Easy Lessons#5/100: The physics of qubits || Quantum Computer Programming in 100 Easy Lessons#14/100: The Unitary property || Quantum Computer Programming in 100 Easy Lessons#24/100: Reversible computing (for CCode→QCode) || Quantum Computer Programming in 100 Easy Lessons#100/100: Why study quantum computing? || Quantum Computer Programming in 100 Easy LessonsLearning About Quantum States 7:  Majorization theorems for the RSK processNP-Hardness of Approximation || @ CMU || Lecture 26e of CS Theory ToolkitProof Complexity for CSPs || @ CMU || Lecture 21a of CS Theory Toolkit#53/100: SAT || Quantum Computer Programming in 100 Easy Lessons#21/100: CCode → QCode, If f then Minus spec || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Basics of Communication Complexity || @ CMU || Lecture 23a of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER