Rounds in communication complexity revisited

Noam Nisan, Avi Widgerson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

42 Scopus citations


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 languageAmerican English
Title of host publicationProceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991
PublisherAssociation for Computing Machinery
Number of pages11
ISBN (Electronic)0897913973
StatePublished - 3 Jan 1991
Event23rd Annual ACM Symposium on Theory of Computing, STOC 1991 - New Orleans, United States
Duration: 5 May 19918 May 1991

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F130073
ISSN (Print)0737-8017


Conference23rd Annual ACM Symposium on Theory of Computing, STOC 1991
Country/TerritoryUnited States
CityNew Orleans

Bibliographical note

Publisher Copyright:
© 1991 ACM.


Dive into the research topics of 'Rounds in communication complexity revisited'. Together they form a unique fingerprint.

Cite this