Multiparty Communication Complexity (1989)
Cached
Download Links
by
Danny Dolev
,
Tomás Feder
| Citations: | 536 - 20 self |
BibTeX
@MISC{Dolev89multipartycommunication,
author = {Danny Dolev and Tomás Feder},
title = {Multiparty Communication Complexity},
year = {1989}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows 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.
