Tensor-rank and lower bounds for arithmetic formulas

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 659-666

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

arithmetic circuits; homogenous circuits; lower bounds; multilinear circuits; tensor rank

Indexed keywords

ARITHMETIC CIRCUIT; DEPTH 3; LOWER BOUNDS; MULTILINEAR CIRCUITS; MULTILINEAR POLYNOMIALS; NEW APPROACHES; POLYNOMIAL SIZE;

COMPUTATION THEORY; INTEGRATING CIRCUITS; LOGIC CIRCUITS; TENSORS;

POLYNOMIALS;

EID: 77954692656     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806780     Document Type: Conference Paper

References (18)

1. S. Aaronson. Multilinear Formulas and Skepticism of Quantum Computing. STOC 2004: 118-127
2. M. Agrawal, V. Vinay. Arithmetic Circuits: A Chasm at Depth Four. FOCS 2008: 67-75
3. W. Baur, V. Strassen. The Complexity of Partial Derivatives. Theor. Comput. Sci. 22: 317-330 (1983)
4. J. von zur Gathen. Algebraic Complexity Theory. Ann. Rev. Computer Science 3: 317-347 (1988)
5. D. Grigoriev, M. Karpinski. An Exponential Lower Bound for Depth 3 Arithmetic Circuits. STOC 1998: 577-582
6. 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)
7. J. Håstad. Tensor Rank is NP-Complete. J. Algorithms 11(4): 644-654 (1990) (preliminary version in ICALP 1989)
8. P. Hrubeš, A. Yehudayoff. Homogeneous Formulas and Symmetric Polynomials, Manuscript 2009
9. N. Nisan. Lower Bounds for Non-Commutative Computation. STOC 1991: 410-418
10. N. Nisan, A. Wigderson. Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Computational Complexity 6(3): 217-234 (1996) (preliminary version in FOCS 1995)
11. R. Raz. Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size. J. ACM 56(2) (2009) (Preliminary version in STOC 2004)
12. 2)
13. R. Raz. Elusive Functions and Lower Bounds for Arithmetic Circuits. STOC 2008: 711-720
14. R. Raz, A. Shpilka, A. Yehudayoff. A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. SIAM J. Comput. 38(4): 1624-1647 (2008) (preliminary version in FOCS 2007)
15. R. Raz, A. Yehudayoff. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. FOCS 2008: 273-282
16. R. Raz, A. Yehudayoff. Lower Bounds and Separations for Constant Depth Multilinear Circuits. IEEE Conference on Computational Complexity 2008: 128-139
17. V. Strassen. Vermeidung von Divisionen. J. Reine Angew. Math. 264: 182-202 (1973)
18. L. G. Valiant, S. Skyum, S. Berkowitz, C. Rackoff. Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12(4): 641-644 (1983)