Uploaded July 2020 | Updated November 2026, 1 day ago
Information Complexity: a modern way to understand communication complexity. Includes a sketch of how the linear lower bound on the randomized communication complexity of Disjointness is proven. Lecture 24c 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:
. "Elements of Information Theory" by Cover and Thomas
. Slides and notes of Mark Braverman
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/)
Information Complexity: a modern way to understand communication complexity. Includes a sketch of how the linear lower bound on the randomized communication complexity of Disjointness is proven. Lecture 24c 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:
. "Elements of Information Theory" by Cover and Thomas
. Slides and notes of Mark Braverman
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/)










