A note on a theorem of Barrington, Straubing and Thérien

Information Processing Letters

Volumn 58, Issue 1, 1996, Pages 31-33

  Caussinus, Hervé ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Computational complexity; Lower bounds; Polynomials

Indexed keywords

EID: 13544277865     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00029-4     Document Type: Article

References (12)

1. D.A. Mix Barrington, A note on a theorem of Razborov, Tech. Rept., University of Massachusetts, 1986.
2. 1, J. Comput. System Sci. 38 (1989) 150-164.
3. D.A. Mix Barrington, R. Beigel and S. Rudich, Representing Boolean functions as polynomials modulo composite numbers, in: Proc. 24th ACM Symp. on Theory of Computing (1992) 455-461.
4. D.A. Mix Barrington and H. Straubing, Superlinear lower bounds for bounded-width branching programs, J. Comput. System Sci. 50 (1991).
5. D.A. Mix Barrington, H. Straubing and D. Thérien, Non uniform automata over groups, Inform. and Comput. 89 (1990) 109-132.
6. 1, J. ACM 35 (1987) 941-952.
7. F. Green, Lower bounds for depth-three circuits with equals and mod-gates, in: Proc. 12th Symp. on Theoretical Aspects of Computer Science (1995) 71-82.
8. M. Krause and S. Waack, Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science (1991) 777-782.
9. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Math. Notes Acad. Sci. USSR 41 (1987) 333-338.
10. R. Smolensky, Algebraic methods in the theory of lower bounds for boolean circuit complexity, in: Proc. 19th ACM Symp. on Theory of Computing (1987) 77-82.
11. R. Smolensky, On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates, in: Proc. 31st IEEE Symp. on Foundations of Computer Science, Vol. 2 (1990) 628-631.
12. m, in: Proc. 25th ACM Symp. on Theory of Computing (1993) 96-101.