Abstract.
Using multi-party communication techniques, we prove that depth-3 circuits with a threshold gate at the top, arbitrary symmetric gates at the next level, and fan-in k MOD m gates at the bottom need exponential size to compute the k-wise inner product function of Babai, Nisan and Szegedy, where m is an odd positive integer satisfying \( m \equiv k \bmod 2m \). This is one of the rare lower-bound results involving MOD m gates with non-prime power moduli.¶Exponential gap theorems are also presented between the multi-party communication complexities of closely related functions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 5, 1994
Rights and permissions
About this article
Cite this article
Grolmusz, V. Circuits and multi-party protocols. comput. complex. 7, 1–18 (1998). https://doi.org/10.1007/PL00001592
Issue Date:
DOI: https://doi.org/10.1007/PL00001592