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: 107.35 GBP
Availability: InStock

Computer Science

This is the most expensive it has ever been. Walk away.

£107 today · previous high £107 · all-time low £75

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 632 days • 632 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 632 days • 7 price levels

Days at Price

Current Price

Price Analysis

Most common price: £82 (411 days, 65.0%)

Price range: £75 - £107

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Mathematics for Future Computing and Communications

Computational Complexity: A Modern Approach

The Nature of Computation

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)

Communication Complexity: and Applications

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)

Algorithmic Complexity and Telecommunication Problems

Computational Complexity: A Conceptual Perspective

Computability and Randomness: 51 (Oxford Logic Guides)

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)

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

Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science ... and Communication Technology, 155)

Algorithmic Information Theory: Mathematics of Digital Information Processing (Signals and Communication Technology)

Proceedings of the 2nd Workshop on Communication Security: Cryptography and Physical Layer Security: 447 (Lecture Notes in Electrical Engineering, 447)

Fundamentals of Information Theory and Coding Design (Discrete Mathematics and Its Applications)

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

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

Digital Communications

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

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

Distributed Computing Through Combinatorial Topology

Complexity, Entropy And The Physics Of Information: The Proceedings of the 1988 Workshop on Complexity, Entropy, and the Physics of Information Held: ... Studies in the Sciences of Complexity)