On Rank vs. Communication Complexity

Noam Nisan; Avi Wigderson

doi:10.1109/SFCS.1994.365711

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 › Conference article › peer-review

28 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)	831-836
Number of pages	6
Journal	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs	https://doi.org/10.1109/SFCS.1994.365711
State	Published - 1994
Event	Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA Duration: 20 Nov 1994 → 22 Nov 1994

Bibliographical note

Publisher Copyright:
© 1994 IEEE.

Access to Document

10.1109/SFCS.1994.365711

Cite this

@article{8dc3a1c2c1794f1b8558fe463ca2493a,

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.",

author = "Noam Nisan and Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} 1994 IEEE.; Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science ; Conference date: 20-11-1994 Through 22-11-1994",

year = "1994",

doi = "10.1109/SFCS.1994.365711",

language = "אנגלית",

pages = "831--836",

journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - On Rank vs. Communication Complexity

AU - Nisan, Noam

AU - Wigderson, Avi

PY - 1994

Y1 - 1994

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.

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

U2 - 10.1109/SFCS.1994.365711

DO - 10.1109/SFCS.1994.365711

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:105031780030

SN - 0272-5428

SP - 831

EP - 836

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

T2 - Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science

Y2 - 20 November 1994 through 22 November 1994

ER -

On Rank vs. Communication Complexity

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this