Proceedings 35th Annual Symposium on Foundations of Computer Science (1994)
Santa Fe, NM, USA
Nov. 20, 1994 to Nov. 22, 1994
N. Nisan , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
A. Wigderson , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
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.
associated function, communication complexity, Boolean function, rank, associated matrix, matrix, deterministic communication complexity
N. Nisan and A. Wigderson, "On rank vs. communication complexity," Proceedings 35th Annual Symposium on Foundations of Computer Science(FOCS), Santa Fe, NM, USA, 1994, pp. 831-836.