- We will send in 10–14 business days.
/images/books/11784703/9781680831146.jpg)
- Author: Tim Roughgarden
- Publisher: Now Publishers
- ISBN-10: 1680831143
- ISBN-13: 9781680831146
- Format: 15.6 x 23.4 x 1.1 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Communication Complexity (for Algorithm Designers) (e-book) (used book) | bookbook.eu
Reviews
Description
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).
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.17:57:57
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Tim Roughgarden
- Publisher: Now Publishers
- ISBN-10: 1680831143
- ISBN-13: 9781680831146
- Format: 15.6 x 23.4 x 1.1 cm, minkšti viršeliai
- Language: English English
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).
Reviews