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

£107.35

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

Name: Lower Bounds in Communication Complexity (Foundations and Trends (R) in Theoretical Computer Science)
Brand: Now Publishers
Price: 82.5 GBP
Availability: InStock

Computer Science

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 37 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £107 (19 days, 51.4%)

Price range: £83 - £107

Price levels: 2 different prices over 37 days

Description

In the 30 years since its inception, communication complexity has become a vital area of theoretical computer science. The applicability of communication complexity to other areas, including circuit and formula complexity, VLSI design, proof complexity, and streaming algorithms, has meant that it has attracted a lot of interest. Lower Bounds in Communication Complexity focuses on showing lower bounds on the communication complexity of explicit functions. It treats different variants of communication complexity, including randomized, quantum, and multiparty models. Many tools have been developed for this purpose from a diverse set of fields including linear algebra, Fourier analysis, and information theory. As is often the case in complexity theory, demonstrating a lower bound is usually the more difficult task. Lower Bounds in Communication Complexity describes a three-step approach for the development and application of these techniques. This approach can be applied in much the same way for different models, be they randomized, quantum, or multiparty. Lower Bounds in Communication Complexity is an ideal primer for anyone with an interest in this current and popular topic.

Product Specifications

Brand: Now Publishers
Format: Paperback
ASIN: 1601982585
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 22 September 2009
Listed Since: 27 October 2009

Barcode

No barcode data available

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Communication Complexity (for Algorithm Designers) (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)

Communication Complexity - Cambridge University Press Book

Computational Complexity: A Modern Approach

Communication Complexity: and Applications

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

Computational Complexity: A Conceptual Perspective

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

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

Dynamic Theory of Communication

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

Channel Coding in the Presence of Side Information (Foundations and Trends (R) in Communications and Information Theory)

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

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

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

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

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

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

Distributed Computing Through Combinatorial Topology

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