Non-commutative circuits and the sum-of-squares problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 667-676

  Hrubeš, Pavel ^a   Wigderson, Avi ^a   Yehudayoff, Amir ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

algebraic complexity; lower bounds

Indexed keywords

ALGEBRAIC COMPLEXITY; ARITHMETIC CIRCUIT; CIRCUIT LOWER BOUNDS; COMPLEX NUMBER; INTEGER COEFFICIENT; LINEAR BOUNDS; LOWER BOUNDS; MULTILINEAR CIRCUITS; NEW STRUCTURES; NON-COMMUTATIVE; REAL NUMBER; SUM OF SQUARES;

ANALOG CIRCUITS; INTEGRATING CIRCUITS; LOGIC CIRCUITS; NUMBER THEORY; POLYNOMIALS;

COMPUTATION THEORY;

EID: 77954739292     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806781     Document Type: Conference Paper

References (35)

1. A. Barvinok. A simple polynomial time algorithm to approximate the permanent within a simply exponential factor. Random Structures and Algorithms 14(1), pages 29-61, 1999.
2. W. Baur and V. Strassen. The complexity of partial derivatives. Theoretical computer science (22), pages 317-330, 1983.
3. P. Burgisser. Completeness and reduction in algebraic complexity theory. Springer-Verlag Berlin Heidelberg 2000.
4. S. Chien and A. Sinclair. Algebras with polynomial identities and computing the determinant. SIAM Journal on Computing 37, pages 252-266, 2007.
5. S. Chien, L. Rasmussen and A. Sinclair. Clifford algebras an approximating the permanent. STOC 02', pages 222-231, 2002.
6. J. von zur Gathen. Algebraic complexity theory. Ann. Rev. Comp. Sci. (3), pages 317-347, 1988.
7. C. Godsil and I. Gutman. On the matching polynomial of a graph. Algebraic Methods in Graph Theory, pages 241-249, 1981.
8. L. Hyafil. On the parallel evaluation of multivariate polynomials. SIAM J. Comput. 8(2), pages 120-123, 1979.
9. P. Hrubeš and A. Yehudayoff. Homogeneous formulas and symmetric polynomials. arXiv:0907.2621
10. P. Hrubeš, A. Wigderson and A. Yehudayoff. Relationless completeness and separations. To appear in CCC.
11. A. Hurwitz. Über die Komposition der quadratischen Formen von beliebigvielen Variabeln. Nach. Ges. der Wiss. Göttingen, pages 309-316, 1898.
12. A. Hurwitz. Über die Komposition der quadratischen Formen. Math. Ann., 88, pages 1-25, 1923.
13. I. M. James. On the immersion problem for real projective spaces. Bull. Am. Math. Soc., 69, pages 231-238, 1967.
14. M. Jerrum, A. Sinclair and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4), pages 671-697, 2004.
15. S. Jukna Boolean function complexity: advances and frontiers. Book in preparation.
16. N. Karmarkar, R. Karp, R. Lipton, L. Lovasz and M. Luby. A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing 22(2), pages 284-293, 1993.
17. T. Kirkman. On pluquatemions, and horaoid products of sums of n squares. Philos. Mag. (ser. 3), 33, pages 447-459; 494-509, 1848.
18. K. Y. Lam. Some new results on composition of quadratic forms. Inventiones Mathematicae., 1985.
19. T. Y. Lam and T. Smith. On Yuzvinsky's monomial pairings. Quart. J. Math. Oxford. (2), 44, pages 215-237, 1993.
20. K. Mulmuley. On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis. Technical Report, Computer Science department, The University of Chicago, 2009.
21. N. Nisan. Lower bounds for non-commutative computation. STOC 91', pages 410-418, 1991.
22. N. Nisan and A. Wigderson. Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity, vol. 6, pages 217-234, 1996.
23. A. Pfister. Zur Darstellung definiter Funktionen als Summe von Quadraten. Inventiones Mathematicae., 1967.
24. J. Radon. Lineare scharen orthogonalen matrizen. Abh. Math. Sem. Univ. Hamburg 1, pages 2-14, 1922.
25. R. Raz. Multi-linear formulas for permanent and determinant are of super-polynomial size. Journal of the Association for Computing Machinery 56 (2), 2009.
26. R. Raz and A. Yehudayoff. Lower bounds and separation for constant depth multilinear circuits. Proceedings of Computational Complexity, pages 128-139, 2008.
27. R. Raz, A. Shpilka and A. Yehudayoff. A lower bound for the size of syntactically multilinear arithmetic circuits. SIAM Journal on Computing 38 (4), pages 1624-1647, 2008.
28. D. B. Shapiro. Composition of quadratic forms. W. de Gruyter Verlag, 2000.
29. V. Strassen. Die berechnungskomplexitat von elementarsymmetrischen funktionen und von interpolationskoe zienten. Numerische Mathematik (20), pages 238-251, 1973.
30. V. Strassen. Vermeidung von Divisionen. J. Reine Angew. Math. 264, pages 182-202, 1973.
31. L. G. Valiant. Completeness classes in algebra. STOC '79, pages 249-261.
32. S. Winograd. On the number of multiplications needed to compute certain functions. Comm. on Pure and Appl. Math. (23), pages 165-179, 1970.
33. P. Yiu. Sums of squares formulae with integer coe cients. Canad. Math. Bull. , 30, pages 318-324, 1987.
34. P. Yiu. On the product of two sums of 16 squares as a sum of squares of integral bilinear forms. Quart. J. Math. Oxford. (2) , 41, pages 463-500, 1990.
35. S. Yuzvinsky. A series of monomial pairings. Linear and multilinear algebra, 15, pages 19-119, 1984.