On rank vs. communication complexity

Noam Nisan*, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

98 Scopus citations

Abstract

This paper concerns the open problem of Lovász and Saks 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.

Original languageAmerican English
Pages (from-to)557-565
Number of pages9
JournalCombinatorica
Volume15
Issue number4
DOIs
StatePublished - Dec 1995

Keywords

  • Mathematics Subject Classification (1991): 68Q05, 68R05, 05C50

Fingerprint

Dive into the research topics of 'On rank vs. communication complexity'. Together they form a unique fingerprint.

Cite this