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 ([ Ссылка ])

Course homepage on CMU's Diderot system: [ Ссылка ]

Thumbnail photo by Rebecca Kiger ([ Ссылка ])

свернуть