Communication Complexity (for Algorithm Designers) (Foundations and Trends in Theoretical Computer Science) by Tim Roughgarden
English | Apr. 8, 2016 | ISBN: 1680831143 | 150 Pages | PDF | 3 MB
Communication Complexity (for Algorithm Designers) collects the lecture notes from the author's eponymous course taught at Stanford in the winter quarter of 2015. The two primary goals of the text are: (1) Learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on). (2) Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.