A lower bound for monotone arithmetic circuits computing 0-1 permanent

Theoretical Computer Science

Volumn 209, Issue 1-2, 1998, Pages 389-398

  Sengupta, Rimli ^a   Venkateswaran, H ^b  

^a ROSE HULMAN INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Arithmetic circuit; Permanent; Size lower bound

Indexed keywords

EID: 0346498305     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00130-3     Document Type: Article

References (9)

1. M. Jerrum, M. Snir, Some exact complexity results for straight-line computations over semi-rings, J. Assoc. Comput. Mach. 29 (1982) 874-897.
2. N. Nisan, Lower bounds for non-commutative computation, Proc. 23rd Ann. ACM Symp. on Theory of Computing, 1991, pp. 410-418.
3. A.A. Razborov, A lower bound on the monotone network complexity of the logical permanent, Mathematischi Zametki 37 (1985) 887-900.
4. W.L. Ruzzo, On uniform circuit complexity, J. Comput. System Sci. 22 (1981) 365-383.
5. E. Shamir, M. Snir, On the depth complexity of formulas, Math. Systems Theory 13 (1980) 301-322.
6. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput. 20 (1991) 865-877.
7. L. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
8. H. Venkateswaran, Circuit definitions of nondeterministic complexity classes, SIAM J. Comput. 21 (1992) 655-670.
9. V. Vinay, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits, Proc. 6th Ann. IEEE Conf. on Structure in Complexity Theory, 1991, pp. 270-284.