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: Chapter in Book/Report/Conference proceeding › Conference contribution › 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
Title of host publication	Proceedings - 35th Annual Symposium on Foundations of Computer Science, FOCS 1994
Publisher	IEEE Computer Society
Pages	831-836
Number of pages	6
ISBN (Print)	0818665807
DOIs	https://doi.org/10.1109/SFCS.1994.365711
State	Published - 1994
Event	35th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1994 - Santa Fe, NM, USA, United States Duration: 20 Nov 1994 → 22 Nov 1994

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)	0272-5428

Conference

Conference	35th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1994
Country/Territory	United States
City	Santa Fe, NM, USA
Period	20/11/94 → 22/11/94

Bibliographical note

Publisher Copyright:
© 1994 IEEE.

Access to Document

10.1109/SFCS.1994.365711

Cite this

@inproceedings{16bfbf2e3285486ba874381d67f869aa,

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.; 35th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1994 ; Conference date: 20-11-1994 Through 22-11-1994",

year = "1994",

doi = "10.1109/SFCS.1994.365711",

language = "אנגלית",

isbn = "0818665807",

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

publisher = "IEEE Computer Society",

pages = "831--836",

booktitle = "Proceedings - 35th Annual Symposium on Foundations of Computer Science, FOCS 1994",

address = "ארצות הברית",

}

Nisan, N & Wigderson, A 1994, On Rank vs. Communication Complexity. in Proceedings - 35th Annual Symposium on Foundations of Computer Science, FOCS 1994. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, IEEE Computer Society, pp. 831-836, 35th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1994, Santa Fe, NM, USA, United States, 20/11/94. https://doi.org/10.1109/SFCS.1994.365711

On Rank vs. Communication Complexity. / Nisan, Noam ; Wigderson, Avi.
Proceedings - 35th Annual Symposium on Foundations of Computer Science, FOCS 1994. IEEE Computer Society, 1994. p. 831-836 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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.contributiontobookanthology.conference???

AN - SCOPUS:105031780030

SN - 0818665807

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

SP - 831

EP - 836

BT - Proceedings - 35th Annual Symposium on Foundations of Computer Science, FOCS 1994

PB - IEEE Computer Society

T2 - 35th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1994

Y2 - 20 November 1994 through 22 November 1994

ER -

On Rank vs. Communication Complexity

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this