Trending Bestseller

Communication Complexity (for Algorithm Designers)

No reviews yet Write a Review
Paperback / softback
08 April 2016
$225.86
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
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).

You Can Find This Title In

    Product Details
    ISBN-13
    9781680831146
    Author
    Tim Roughgarden
    Publisher
    Now Publishers
    Published
    08 April 2016
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $225.86
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Communication Complexity (for Algorithm Designers)

    $225.86

    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).

    You Can Find This Title In

      This Title Is Categorised As