Multiparty Communication Complexity

  title={Multiparty Communication Complexity},
  author={Danny Dolev and Tom{\'a}s Feder},
A given Boolean function has its input distributed among ma,ny parties. The aim is to determine which parties t o talk t o and what information t o exchange with each of them in order to evduate the function while minimizing the total communication. This paper shows t1ia.t it is possible to the Boolean answer deterministically with only a polynomial increase in communication with respect to the inforiliatioil lower bound given by the nondet.erniinistic communica.tion complexity of the… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

The Power of Randomness for Communication Complexity,

  • M. Fiirer
  • Proc. 19th ACM STOC,
  • 1987

Conimunication Coinplexity,

  • C. H. Papadimitriou, M. Sipser
  • Proc. 14th ACM STOC,
  • 1982

Las Vegas is better than Deterininisin in VLSI and Distributed Computing,

  • I. Melhorn, E. M. Schmidt
  • Proc. 14th ACM STOC,
  • 1982

Some coiiiplesity questions related to distributive computing ,

  • A. Yao
  • P roc. 11th ACM STOC,
  • 1979

Similar Papers

Loading similar papers…