On rank vs. communication complexity

Noam Nisan; Avi Wigderson

doi:10.1007/BF01192527

On rank vs. communication complexity

Noam Nisan^*
, Avi Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

108 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 language	English
Pages (from-to)	557-565
Number of pages	9
Journal	Combinatorica
Volume	15
Issue number	4
DOIs	https://doi.org/10.1007/BF01192527
State	Published - Dec 1995

Keywords

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

Access to Document

10.1007/BF01192527

Cite this

@article{669af5757ab14b69b32968a184dc5cad,

title = "On rank vs. communication complexity",

abstract = "This paper concerns the open problem of Lov{\'a}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.",

keywords = "Mathematics Subject Classification (1991): 68Q05, 68R05, 05C50",

author = "Noam Nisan and Avi Wigderson",

year = "1995",

month = dec,

doi = "10.1007/BF01192527",

language = "אנגלית",

volume = "15",

pages = "557--565",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "4",

}

TY - JOUR

T1 - On rank vs. communication complexity

AU - Nisan, Noam

AU - Wigderson, Avi

PY - 1995/12

Y1 - 1995/12

N2 - 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.

AB - 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.

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

UR - https://www.scopus.com/pages/publications/21844488639

U2 - 10.1007/BF01192527

DO - 10.1007/BF01192527

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:21844488639

SN - 0209-9683

VL - 15

SP - 557

EP - 565

JO - Combinatorica

JF - Combinatorica

IS - 4

ER -

On rank vs. communication complexity

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this