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
Price: 82.5 GBP
Availability: OutOfStock

Algorithms

Price History & Forecast

Last 64 days • 64 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 64 days • 1 price levels

Days at Price

Price Analysis

Most common price: £83 (64 days, 100.0%)

Price range: £83 - £83

Price levels: 1 different prices over 64 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)

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

Complexity Lower Bounds using Linear Algebra (Foundations and Trends (R) in Theoretical Computer Science)

Asymptotic Frame Theory for Analog Coding (Foundations and Trends® in Communications and Information Theory)

Algorithmic Complexity and Telecommunication Problems

Fundamentals of Index Coding (Foundations and Trends (R) in Communications and Information Theory)

Computational Complexity: A Conceptual Perspective

Universal Semantic Communication

Coded Computing: Mitigating Fundamental Bottlenecks in Large-scale Distributed Computing and Machine Learning (Foundations and Trends® in Communications and Information Theory)

Scalable Algorithms for Data and Network Analysis (Foundations and Trends (R) in Theoretical Computer Science)

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Communication Complexity - Cambridge University Press Book

Computational Complexity: A Modern Approach

Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources (Foundations and Trends® in Communications and Information Theory)

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Concentration of Measure Inequalities in Information Theory, Communications, and Coding: Third Edition (Foundations and Trends (R) in Communications and Information Theory)

Information and Communication Theory (IEEE Series on Digital & Mobile Communication)

Distributed Computing Through Combinatorial Topology

Coding for Interactive Communication: A Survey (Foundations and Trends in Theoretical Computer Science)

Communication Systems: New Research (Media and Communications - Technologies, Policies and Challenges)

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

Probability and Random Processes: With Applications to Signal Processing and Communications

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

Wireless Communications from the Ground Up: An SDR Perspective