Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


On multi-party communication complexity of random functions

Grolmusz, Vince

MPI-I-93-162. December 1993, 10 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We prove that almost all Boolean function has a high $k$--party communication complexity. The 2--party case was settled by {\it Papadimitriou} and {\it Sipser}.
Proving the $k$--party case needs a deeper investigation of the underlying structure
of the $k$--cylinder--intersections; (the 2--cylinder--intersections are the rectangles).

\noindent First we examine the basic properties of $k$--cylinder--intersections, then an upper estimation is given for their number, which facilitates to prove the lower--bound theorem for the $k$--party communication complexity of randomly chosen Boolean functions. In the last section we extend our results to the $\varepsilon$--distributional communication complexity of random functions.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-93-162.pdfMPI-I-93-162.pdf6426 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Grolmusz, Vince},
  TITLE = {On multi-party communication complexity of random functions},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-162},
  MONTH = {December},
  YEAR = {1993},
  ISSN = {0946-011X},