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