Rounds in communication complexity revisited

Noam Nisan; Avi Widgerson

doi:10.1145/103418.103463

Rounds in communication complexity revisited

Noam Nisan, Avi Widgerson

The Rachel and Selim Benin School of Engineering and Computer Science

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

46 Scopus citations

Abstract

The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds that give (1) randomization is more powerful than determinism in k-round protocols, and (2) an explicit function which (exhibits an exponential gap between its k and (k - l)-round randomized complexity. We also study the three party communication model, and exhibit an exponential gap in 3-round protocols that differ in the starting player, Finally, we show new connections of these questions to circuit colmpletity, that motivate further work in his direction.

Original language	English
Title of host publication	Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991
Publisher	Association for Computing Machinery
Pages	419-429
Number of pages	11
ISBN (Electronic)	0897913973
DOIs	https://doi.org/10.1145/103418.103463
State	Published - 3 Jan 1991
Event	23rd Annual ACM Symposium on Theory of Computing, STOC 1991 - New Orleans, United States Duration: 5 May 1991 → 8 May 1991

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F130073
ISSN (Print)	0737-8017

Conference

Conference	23rd Annual ACM Symposium on Theory of Computing, STOC 1991
Country/Territory	United States
City	New Orleans
Period	5/05/91 → 8/05/91

Bibliographical note

Publisher Copyright:
© 1991 ACM.

Access to Document

10.1145/103418.103463

Cite this

@inproceedings{c6246a8e937b420383cd910ea0c3dcd5,

title = "Rounds in communication complexity revisited",

abstract = "The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds that give (1) randomization is more powerful than determinism in k-round protocols, and (2) an explicit function which (exhibits an exponential gap between its k and (k - l)-round randomized complexity. We also study the three party communication model, and exhibit an exponential gap in 3-round protocols that differ in the starting player, Finally, we show new connections of these questions to circuit colmpletity, that motivate further work in his direction.",

author = "Noam Nisan and Avi Widgerson",

note = "Publisher Copyright: {\textcopyright} 1991 ACM.; 23rd Annual ACM Symposium on Theory of Computing, STOC 1991 ; Conference date: 05-05-1991 Through 08-05-1991",

year = "1991",

month = jan,

day = "3",

doi = "10.1145/103418.103463",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "419--429",

booktitle = "Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991",

}

Nisan, N & Widgerson, A 1991, Rounds in communication complexity revisited. in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F130073, Association for Computing Machinery, pp. 419-429, 23rd Annual ACM Symposium on Theory of Computing, STOC 1991, New Orleans, United States, 5/05/91. https://doi.org/10.1145/103418.103463

Rounds in communication complexity revisited. / Nisan, Noam ; Widgerson, Avi.
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991. Association for Computing Machinery, 1991. p. 419-429 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F130073).

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

TY - GEN

T1 - Rounds in communication complexity revisited

AU - Nisan, Noam

AU - Widgerson, Avi

PY - 1991/1/3

Y1 - 1991/1/3

N2 - The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds that give (1) randomization is more powerful than determinism in k-round protocols, and (2) an explicit function which (exhibits an exponential gap between its k and (k - l)-round randomized complexity. We also study the three party communication model, and exhibit an exponential gap in 3-round protocols that differ in the starting player, Finally, we show new connections of these questions to circuit colmpletity, that motivate further work in his direction.

AB - The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds that give (1) randomization is more powerful than determinism in k-round protocols, and (2) an explicit function which (exhibits an exponential gap between its k and (k - l)-round randomized complexity. We also study the three party communication model, and exhibit an exponential gap in 3-round protocols that differ in the starting player, Finally, we show new connections of these questions to circuit colmpletity, that motivate further work in his direction.

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

U2 - 10.1145/103418.103463

DO - 10.1145/103418.103463

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85031940329

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 419

EP - 429

BT - Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991

PB - Association for Computing Machinery

T2 - 23rd Annual ACM Symposium on Theory of Computing, STOC 1991

Y2 - 5 May 1991 through 8 May 1991

ER -

Rounds in communication complexity revisited

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this