A note on MODp - MODm circuits

Theory of Computing Systems

Volumn 39, Issue 5, 2006, Pages 699-706

  Straubing, Howard ^a   Thérien, Denis ^b  

^a BOSTON COLLEGE   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING POWER; CONSTANT-DEPTH CIRCUITS; FIXED NUMBERS; SINGLE LAYER;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 33748524542     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1210-2     Document Type: Article

References (8)

1. D. M. Barrington and H. Straubing, Lower Bounds for Modular Counting by Circuits with Modular Gates, in Proceedings of the 2nd Latin American Symposium on Theoretical Computer Science, pp. 60-71, Lecture Notes in Computer Science, 911, Springer, Berlin, 1995.
2. D.M. Barrington, H. Straubing, and D. Thérien, Nonuniform Automata over Groups, Inform. and Comput. 89 (1990), 109-132.
3. R. Beigel and J. Tarui, On ACC, Comput. Complexity 4 (1994), 350-366.
4. R. Fagin, M. Klawe, N. Pippenger, and L. Stockmeyer, Bounded-Depth, Polynomia-Size Circuits for Symmetric Functions, Theoret. Comput. Sci. 36 (1985), 239-250.
5. M. Furst, J. Saxe, and M. Sipser, Parity, Circuits, and the Polynomial Time Hierarchy, J. Math. Systems Theory 17 (1984), 13-27.
6. m) Circuits, SIAM J. Comput. 29(4), 1209-1222.
7. M. Krause and P. Pudlák, On the Computational Power of Depth 2 Circuits with Threshold and Modular Gates, Theoret. Comput. Sci. 174 (1997), 137-156.
8. R. Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity, Proc. 19th ACM STOC, pp. 77-82, 1987.