Separating the communication complexities of MOD m and MOD p circuits

Authors:
V. Grolmusz
Affiliations:
Max Planck Inst., Saarbrucken, Germany
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 3

On the Non-deterministic Communication Complexity of Regular Languages

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Languages with bounded multiparty communication complexity

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The NOF multiparty communication complexity of composed functions

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The author proves in this paper that it is much harder to evaluate depth-2, size-N circuits with MOD m gates than with MOD p gates by k-party communication protocols: he shows a k-party protocol which communicates O(1) bits to evaluate circuits with MOD p gates, while evaluating circuits with MOD m gates needs Omega (N) bits, where p denotes a prime, and m a composite, non-prime power number. As a corollary, for all m, he shows a function, computable with a depth-2 circuit with MOD m gates, but not with any depth-2 circuit with MOD p gates. He proves in the second part that the GIP function by L. Babai et al. (1989) needs exponential size in n when it is computed by some depth-3 circuits, with threshold, symmetric, and MOD m gates.