Multiparty communication complexity

Authors:
D. Dolev;T. Feder
Affiliations:
Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel;-
Venue:
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Year:
1989

Citing 0
Cited 3

Multiparty Communication Complexity: Very Hard Functions

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Partition Arguments in Multiparty Communication Complexity

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Silence-based communication

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

A given Boolean function has its input distributed among many parties. The aim is to determine which parties to talk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. It is shown that it is possible to obtain the Boolean answer deterministically with only a polynomial increase in communication with respect to the information lower bound given by the nondeterministic communication complexity of the function.