Uploaded July 2020 | Updated November 2026, 19 hours ago
Herein: the statement of Yao's Minimax Theorem, the main tool for proving randomized communication complexity lower bounds; and, using this and Fourier analysis of Boolean functions to show that the randomized communication complexity of the inner-product-mod-2 function is linear.
Lecture 23d 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/)
Herein: the statement of Yao's Minimax Theorem, the main tool for proving randomized communication complexity lower bounds; and, using this and Fourier analysis of Boolean functions to show that the randomized communication complexity of the inner-product-mod-2 function is linear.
Lecture 23d 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/)










