On rank vs. communication complexity

This paper concerns the open problem of Lovasz and Saks (1988) regarding the relationship between the communication complexity of a Boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.<<ETX>>

[1]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[2]  Michael E. Saks,et al.  Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[3]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[4]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[5]  Siemion Fajtlowicz,et al.  On conjectures of Graffiti , 1988, Discret. Math..

[6]  Noga Alon,et al.  A counterexample to the rank-coloring conjecture , 1989, J. Graph Theory.

[7]  A. A. Razborov.  The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear , 1992, Discret. Math..

[8]  Paul A. Catlin.  A bound on the chromatic number of a graph , 1978, Discret. Math..

[9]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[10]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[12]  Ran Raz,et al.  On the "log rank"-conjecture in communication complexity , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.