Lower Bounds in Communication Complexity

Lower Bounds in Communication Complexity
Author :
Publisher : Now Publishers Inc
Total Pages : 152
Release :
ISBN-10 : 9781601982582
ISBN-13 : 1601982585
Rating : 4/5 (585 Downloads)

Book Synopsis Lower Bounds in Communication Complexity by : Troy Lee

Download or read book Lower Bounds in Communication Complexity written by Troy Lee and published by Now Publishers Inc. This book was released on 2009 with total page 152 pages. Available in PDF, EPUB and Kindle. Book excerpt: The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph surveys lower bounds in the field of communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space. That is to say, the first step in these lower bound techniques is to find a geometric complexity measure, such as rank or trace norm, that serves as a lower bound to the underlying communication complexity measure. Lower bounds on this geometric complexity measure are then found using algebraic and geometric tools.


Lower Bounds in Communication Complexity Related Books

Lower Bounds in Communication Complexity
Language: en
Pages: 152
Authors: Troy Lee
Categories: Computers
Type: BOOK - Published: 2009 - Publisher: Now Publishers Inc

DOWNLOAD EBOOK

The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to det
Communication Complexity (for Algorithm Designers)
Language: en
Pages: 206
Authors: Tim Roughgarden
Categories:
Type: BOOK - Published: 2016-05-11 - Publisher: Foundations and Trends (R) in Theoretical Computer Science

DOWNLOAD EBOOK

This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of
Complexity Lower Bounds Using Linear Algebra
Language: en
Pages: 177
Authors: Satyanarayana V. Lokam
Categories: Computers
Type: BOOK - Published: 2009-07-20 - Publisher: Now Publishers Inc

DOWNLOAD EBOOK

We survey several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches. The comm
Communication Complexity
Language: en
Pages: 209
Authors: Eyal Kushilevitz
Categories: Computers
Type: BOOK - Published: 2006-11-02 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Surveys the mathematical theory and applications such as computer networks, VLSI circuits, and data structures.
Communication Complexity and Parallel Computing
Language: en
Pages: 347
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2013-03-09 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal compl