Abstract
We prove that constant depth circuits, with one layer of MOD m gates at the inputs, followed by a fixed number of layers of MOD p gates, where p is prime, require exponential size to compute the MOD q function, if q is a prime that divides neither p nor q.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
References
M. Ajtai, “Σ 11 formulae on finite structures”, Annals of Pure and Applied Logic 24 (1983) 1–48.
D. Mix Barrington, H. Straubing, and D. Thérien, “Nonuniform Automata over Groups”, Information and Computation 89 (1990) 109–132.
J. Bruck, “Harmonic Analysis of Polynomial Threshold Functions”, SIAM Journal of Discrete Mathematics 3 (1990) 168–177.
M. Furst, J. Saxe, and M. Sipser, “Parity, Circuits, and the Polynomial Time Hierarchy”, J. Math Systems Theory 17 (1984) 13–27.
M. Krause and P. Pudlák, “On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates”, Proc. 26th ACM STOC (1994) 48–57.
P. McKenzie, P. Péladeau, and D. Thérien, NC 1: “The Automata-Theoretic Approach”, to appear in Theoretical Computer Science.
R. Smolensky, “Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity”, Proc. 19th ACM STOC (1987) 77–82.
H. Straubing, “Constant-depth Periodic Circuits”, International J. Algebra and Computation 1 (1991) 49–88.
H. Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkhäuser, Boston, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrington, D.M., Straubing, H. (1995). Lower bounds for modular counting by circuits with modular gates. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_81
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive