Article

Free access

The power of randomness for communication complexity

Author:

M. FurerAuthors Info & Claims

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

Pages 178 - 181

https://doi.org/10.1145/28395.28415

Published: 01 January 1987 Publication History

PDF eReader

Abstract

Improving a result of Mehlhorn and Schmidt, a function f with deterministic communication complexity n² is shown to have Las Vegas communication complexity Ο(n). This is the best possible, because the deterministic complexity cannot be more than the square of the Las Vegas communication complexity for any function.

References

[1]

Aho, A.V., Ullman, J.D. & Yannakakis, M. (1983), On Notations of Information Transfer in VLSI Circuits, 15th STOC, 133-139.

Digital Library

Google Scholar

[2]

Hardy & Wright (1979), An Introduction to the Theory of Numbers, 5th ed., Oxford.

Google Scholar

[3]

Mehlhorn, K. & Schmidt, E.M. (1982), Las Vegas is better than Determinism in VLSI and Distributed Computing (Ex. Ab.), 14th STOC, 330-337.

Digital Library

Google Scholar

[4]

Yao, A.C. (1979), Some Complexity Questions Related to Distributive Computing, llth STOC, 209-213.

Digital Library

Google Scholar

[5]

Yao, A.C. (1981), The Entropic Limitations on VLSI Computation, 13th STOC, 308-311.

Digital Library

Google Scholar

Cited By

View all

Davis BHatami HPires WTao RUsmani H(2022)On public-coin zero-error randomized communication complexityInformation Processing Letters10.1016/j.ipl.2022.106293(106293)Online publication date: Jun-2022
https://doi.org/10.1016/j.ipl.2022.106293
Ďuriš PRolim J(2005)Optimal lower bounds on the multiparty communication complexitySTACS 9510.1007/3-540-59042-0_87(350-360)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59042-0_87
Fleischer RJung HMehlhorn K(2005)A time-randomness tradeoff for communication complexityDistributed Algorithms10.1007/3-540-54099-7_26(390-401)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-54099-7_26
Show More Cited By

Index Terms

The power of randomness for communication complexity

Recommendations

A Communication-Randomness Tradeoff for Two-Processor Systems

We present a tight tradeoff between the expected communication complexity C (for a two-processor system) and the number R of random bits used by any Las Vegas protocol for the list-nondisjointness function of two lists of n numbers of n bits each. This ...
Amortized Communication Complexity

In this work we study the direct-sum problem with respect to communication complexity: Consider a relation $f$ defined over $\{0,1\}^{n} \times \{0,1\}^{n}$. Can the communication complexity of simultaneously computing $f$ on $\cal l$ instances $(x_1,...
On the bit communication complexity of randomized rumor spreading
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures

We study the communication complexity of rumor spreading in the random phone-call model. Suppose nplayers communicate in parallel rounds, where in each round every player calls a randomly selected communication partner. A player u is allowed to exchange ...

Comments

Information & Contributors

Information

Published In

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

January 1987

471 pages

ISBN:0897912217

DOI:10.1145/28395

Editor:
Alfred V. Aho

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC87

Sponsor:

SIGACT

STOC87: 19th Annual ACM Conference on Theory of Computing

New York, New York, USA

Acceptance Rates

STOC '87 Paper Acceptance Rate 50 of 165 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
306
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)10

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Davis BHatami HPires WTao RUsmani H(2022)On public-coin zero-error randomized communication complexityInformation Processing Letters10.1016/j.ipl.2022.106293(106293)Online publication date: Jun-2022
https://doi.org/10.1016/j.ipl.2022.106293
Ďuriš PRolim J(2005)Optimal lower bounds on the multiparty communication complexitySTACS 9510.1007/3-540-59042-0_87(350-360)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59042-0_87
Fleischer RJung HMehlhorn K(2005)A time-randomness tradeoff for communication complexityDistributed Algorithms10.1007/3-540-54099-7_26(390-401)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-54099-7_26
Ďuriš P(2004)Multiparty communication complexity and very hard functionsInformation and Computation10.1016/j.ic.2004.03.002192:1(1-14)Online publication date: 1-Jul-2004
https://dl.acm.org/doi/10.1016/j.ic.2004.03.002
Fürer M(2004)An Improved Communication-Randomness TradeoffLATIN 2004: Theoretical Informatics10.1007/978-3-540-24698-5_48(444-454)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24698-5_48
Jayram TKumar RSivakumar DLarmore LGoemans M(2003)Two applications of information complexityProceedings of the thirty-fifth annual ACM symposium on Theory of computing10.1145/780542.780640(673-682)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/780542.780640
Naor MNissim KVitter JSpirakis PYannakakis M(2001)Communication preserving protocols for secure function evaluationProceedings of the thirty-third annual ACM symposium on Theory of computing10.1145/380752.380855(590-599)Online publication date: 6-Jul-2001
https://dl.acm.org/doi/10.1145/380752.380855
Tamm U(2000)Communication Complexity of Functions on Direct SumsNumbers, Information and Complexity10.1007/978-1-4757-6048-4_47(589-602)Online publication date: 2000
https://doi.org/10.1007/978-1-4757-6048-4_47
Ďuriš PRolim J(1998)Lower Bounds on the Multiparty Communication ComplexityJournal of Computer and System Sciences10.1006/jcss.1997.154756:1(90-95)Online publication date: 1-Feb-1998
https://dl.acm.org/doi/10.1006/jcss.1997.1547
Beame PLawry JKosaraju RFellows MWigderson AEllis J(1992)Randomized versus nondeterministic communication complexityProceedings of the twenty-fourth annual ACM symposium on Theory of Computing10.1145/129712.129732(188-199)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.1145/129712.129732
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A Communication-Randomness Tradeoff for Two-Processor Systems

Amortized Communication Complexity

On the bit communication complexity of randomized rumor spreading

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

A Communication-Randomness Tradeoff for Two-Processor Systems

Amortized Communication Complexity

On the bit communication complexity of randomized rumor spreading

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations