Multi-linear formulas for permanent and determinant are of super-Polynomial size

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 633-641

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Algebraic complexity; Arithmetic formulas; Circuit complexity; Computational complexity; Lower bounds

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY;

ALGEBRAIC COMPLEXITY; ARITHMETIC FORMULAS; CIRCUIT COMPLEXITY; COMPLEXITY THEORY; LOWER BOUNDS;

COMPUTATIONAL COMPLEXITY;

EID: 4544258177     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007353     Document Type: Conference Paper

References (17)

1. S. Aaronson. Multilinear Formulas and Skepticism of Quantum Computing. STOC 2004
2. N. Alon, J.H. Spencer, P.Erdos. The Probabiliatic Method. John Wiley and Sons, Inc., (1992)
3. P. Burgisser, M. Clausen, M. A. Shokrollahi. Algebraic Complexity Theory. Springer-Verlag New York, Inc., (1997)
4. J. von zur Gathen. Feasible Arithmetic Computations: Valiant's Hypothesis. J. Symbolic Computation 4(2): 137-172 (1987)
5. J. von zur Gathen. Algebraic Complexity Theory. Ann. Rev. Computer Science 3: 317-347 (1988)
6. D. Grigoriev, M. Karpinski. An Exponential Lower Bound for Depth 3 Arithmetic Circuits. STOC 1998: 577-582
7. D. Grigoriev, A. A. Razborov. Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. Applicable Algebra in Engineering, Communication and Computing 10(6): 465-487 (2000) (preliminary version in FOCS 1998)
8. R. Impagliazzo, V. Kabanets. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. STOC 2003: 355-364
9. A. Kalorkoti. The Formula Size of the Determinant. SIAM Journal of Computing 14: 678-687 (1995)
10. N. Nisan. Lower Bounds for Non-Commutative Computation. STOC 1991: 410-418
11. N. Nisan, A. Wigderson. Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Computational Complexity 6(3): 217-234 (1996) (preliminary version in FOCS 1995)
12. R. Raz, A. Shpilka. Deterministic Polynomial Identity Testing in Non Commutative Models. Conference on Computational Complexity 2004 (to appear)
13. C. P. Schnorr. A Lower Bound on the Number of Additions in Monotone Computations. Theoretical Computer Science 2(3): 305-315 (1976)
14. E. Shamir, M. Snir. On the Depth Complexity of Formulas. Mathematical Systems Theory 13: 301-322 (1980)
15. A. Shpilka, A. Wigderson. Depth-3 Arithmetic Circuits Over Fields of Characteristic Zero. Computational Complexity 10(1): 1-27 (2001) (preliminary version in Conference on Computational Complexity 1999)
16. L. G. Valiant. Negation can be Exponentially Powerful. Theoretical Computer Science 12: 303-314 (1980)
17. L. G. Valiant. Why is Boolean Complexity Theory Difficult? In Boolean Function Complexity (M. S. Paterson, ed.) Lond. Math. Soc. Lecture Note Ser. Vol. 169, Cambridge Univ. Press 84-94 (1992)