Lower Bounds in Communication Complexity
Foundations and Trends® in Theoretical Computer Science · 2009
DOI: 10.1561/0400000040 ↗At a glance
Journal article in Foundations and Trends® in Theoretical Computer Science, 2009. Written by Troy Lee and 1 co-authors. Cited 47 times so far (Crossref); 104 references.
Abstract (original language)
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.
Cite
APA
Lee, T., & Shraibman, A. (2009). Lower Bounds in Communication Complexity. Foundations and Trends® in Theoretical Computer Science. https://doi.org/10.1561/0400000040
Vancouver
Lee T, Shraibman A. Lower Bounds in Communication Complexity. Foundations and Trends® in Theoretical Computer Science. 2009. doi:10.1561/0400000040
BibTeX
@article{Lee2009,
author = {Lee, Troy and Shraibman, Adi},
title = {Lower Bounds in Communication Complexity},
journal = {Foundations and Trends® in Theoretical Computer Science},
year = {2009},
doi = {10.1561/0400000040}
}
EUVIMED