Published on *Computer Science Department at Princeton University* (https://www.cs.princeton.edu)

Report ID:

TR-204-89

Authors:

Lovasz, Laszlo [1]

Date:

February 1989

Pages:

36

Download Formats:

[PDF [2]]

The basic question in communication complexity theory is to find the minimum number of bits two processors have to communicate in order to find the value of a 2-variable function, if one knows the value of the first variable and the other knows the value of the second. This paper surveys some basic and recent results in this theory. The connections with VLSI are sketched. There are general lower and upper bounds involving the rank of the associated matrix and non-determinism. A recent upper bound by M. Saks and the author, extending an important result of Aho, Ullman and Yannakakis is presented. Using this, it is shown that for a large class of communication complexity problems, the

square of the linear algebra lower bound on the communication complexity is an upper bound. The so-called Moebius function of lattices plays an important role. Further areas surveyed are randomized protocols and the applications of communication complexity in the other areas of complexity theory.

**Links**

[1] https://www.cs.princeton.edu/research/techreps/author/123

[2] ftp://ftp.cs.princeton.edu/techreports/1989/204.pdf