Communication vs. Computation

Authors:
Prahladh Harsha;Yuval Ishai;Joe Kilian;Kobbi Nissim;S. Venkatesh
Affiliations:
Toyota Technological Institute, Chicago, USA 60637;Computer Science Department, Technion, Haifa, Israel 32000;Computer Science Department, Rutgers University, New Brunswick, USA 08854;Department of Computer Science, Ben-Gurion University, Beer Sheva, Israel 84105;Computer Science Department, University of Victoria, Victoria, Canada V8W 3P6
Venue:
Computational Complexity
Year:
2007

Citing 21
Cited 0

NP is as easy as detecting unique solutions

Theoretical Computer Science
Lower bounds on communication complexity

Information and Computation
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity

SIAM Journal on Computing - Special issue on cryptography
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The discrete log is very discreet

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The round complexity of secure protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems

Journal of the ACM (JACM)
Rounds in communication complexity revisited

SIAM Journal on Computing
Computerized patient information system in a psychiatric unit: five-year experience

Journal of Medical Systems
Communication-Space Tradeoffs for UnrestrictedProtocols

SIAM Journal on Computing
Bounds on tradeoffs between randomness and communication complexity

Computational Complexity
Communication complexity

Communication complexity
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Communication complexity

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Multi-party protocols

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Communication Complexity of Simultaneous Messages

SIAM Journal on Computing
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is the following: Is there a computational task that exhibits a strong tradeoff behavior between the amount of communication and the amount of time needed for local computation?Under various standard assumptions, we exhibit Boolean functions that show strong tradeoffs between communication and time complexity in the following scenarios:Finally, we study a time-degree tradeoff problem that arises in arithmetization of Boolean functions, and relate it to time-communication tradeoff questions in multi-party communication complexity and cryptography.