On rank vs. communication complexity

Authors:
N. Nisan;A. Wigderson
Affiliations:
Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel;Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
Venue:
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Year:
1994

Citing 0
Cited 3

Cryptographic primitives enforcing communication and storage complexity

FC'02 Proceedings of the 6th international conference on Financial cryptography
Properties and applications of boolean function composition

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Superlinear advantage for exact quantum algorithms

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.