Can I read Communication Complexity (for Algorithm Designers) (Foundations and Trends(r) in Theoretical Computer Science) on EtoBox?

Communication Complexity (for Algorithm Designers) (Foundations and Trends(r) in Theoretical Computer Science) by Tim Roughgarden is a book available to read on EtoBox.

What is Communication Complexity (for Algorithm Designers) (Foundations and Trends(r) in Theoretical Computer Science) about?

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. Along the way, readers will also get exposure to a lot of cool computational models and some famous results about them - data streams and linear sketches, compressive sensing, space-query time trade-offs in data structures, sublinear-time algorithms, and the extension complexity of linear programs. We also scratch the surface of techniques for proving communication complexity lower bounds (fooling sets, corruption arguments, and so on). Readers are assumed to be familiar with undergraduate-level algorithms, as well as the statements of standard large deviation inequalities (Markov, Chebyshev, and Chernoff- Hoeffding).

Author

Tim Roughgarden

Publisher

Now Publishers Inc

Published

2016

Language

EN

ISBN

9781680831146

Subjects

Computer Science, Stem