Deterministic Communication Complexity || @ CMU || Lecture 23b of CS Theory Toolkit @RyanODonnellTeaching
Deterministic Communication Complexity || @ CMU || Lecture 23b of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 3 hours ago
The basics of deterministic communication complexity: communication protocols, the communication matrix, combinatorial rectangles, the deterministic communication complexity of equality, and the Log Rank conjecture.

Lecture 23b 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/)
Deterministic Communication Complexity || @ CMU || Lecture 23b of CS Theory Toolkit#27/100: Loading ±1 truth tables into the state || Quantum Computer Programming in 100 Easy LessonsConstraint Satisfaction Problems || @ CMU || Lecture 20b of CS Theory ToolkitThis ONE Instruction Instantly Makes Scratch Into A Quantum Computer!!
Ryan ODonnell |

Deterministic Communication Complexity || @ CMU || Lecture 23b of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER