Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science) - Image 1

Out of stock

This item is currently unavailable

Now Publishers Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science)

Name: Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science)
Brand: Now Publishers

Algorithms

Gone for 159 days. Could come back at any time — we're watching for you.

Out of stock 159 days · last price £83 · longest previous gap was 1 days

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 717 days · 717 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 717 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £82 (228 days, 31.8%)

Price range: £70 - £82

Price levels: 5 different prices over 717 days

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

Product Specifications

Brand: Now Publishers
Format: paperback
ASIN: 1680831143
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 08 April 2016
Listed Since: 15 April 2016

Barcode

No barcode data available

Now Publishers Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science)

Gone for 159 days. Could come back at any time — we're watching for you.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Lower Bounds in Communication Complexity (Foundations and Trends (R) in Theoretical Computer Science)

Communication Complexity: and Applications

Distributed Computing Through Combinatorial Topology

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Theoretical and Mathematical Foundations of Computer Science: Second International Conference, ICTMF 2011, Singapore, May 5-6, 2011, Revised Selected ... in Computer and Information Science, 164)

Mathematics for Future Computing and Communications

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

The Complexity of Human Communication (The Hampton Press Communication Series) (Hampton Press Communication Series: Women and Communication)

Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, ... (Lecture Notes in Computer Science, 5734)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Learning to Live in the Knowledge Society: IFIP 20th World Computer Congress, IFIP TC 3 ED-L2L Conference, September 7-10, 2008, Milano, Italy: 281 ... and Communication Technology, 281)

Information And Complexity: 6 (World Scientific Series in Information Studies)

Digital Communications

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

Performance Limits in Communication Theory and Practice: 142 (NATO Science Series E:, 142)

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

Data Communication Systems and Their Performance: Proceedings of the IFIP TC6 Fourth International Conference on Data Communication Systems and Their Performance, Barcelona, Spain, 20-22 June, 1990

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Springer Advances in Computational Science and Engineering

Limits of Computation: An Introduction to the Undecidable and the Intractable