de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Circuits and multi-party protocols

MPS-Authors

Grolmusz,  Vince
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

92-104_ch.pdf
(Any fulltext), 10MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Grolmusz, V.(1992). Circuits and multi-party protocols (MPI-I-92-104). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B6E7-C
Abstract
We present a multi--party protocol for computing certain functions of an $n\times k$ $0-1$ matrix $A$. The protocol is for $k$ players, where player $i$ knows every column of $A$, except column $i$. {\it Babai, Nisan} and {\it Szegedy} proved that to compute $GIP(A)$ needs $\Omega (n/4^k)$ bits to communicate. We show that players can count those rows of matrix $A$ which sum is divisible by $m$, with communicating only $O(mk\log n)$ bits, while counting the rows with sum congruent to 1 $\pmod m$ needs $\Omega (n/4^k)$ bits of communication (with an odd $m$ and $k\equiv m\pmod {2m}$). $\Omega(n/4^k)$ communication is needed also to count the rows of $A$ with sum in any congruence class modulo an {\it even} $m$. The exponential gap in communication complexities allows us to prove exponential lower bounds for the sizes of some bounded--depth circuits with MAJORITY, SYMMETRIC and MOD$_m$ gates, where $m$ is an odd -- prime or composite -- number.