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 ([ Ссылка ])
Course homepage on CMU's Diderot system: [ Ссылка ]
Thumbnail photo by Rebecca Kiger ([ Ссылка ])
![](https://s2.save4k.ru/pic/zFHWmmThdT4/maxresdefault.jpg)