Relationless completeness and separations

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2010, Pages 280-290

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

^a Princeton University   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Algebraic complexity; Completeness; Separations

Indexed keywords

ALGEBRAIC COMPLEXITY; ASSOCIATIVITY; COMBINATORIAL PROBLEM; COMMUTATIVITY; EXPLICIT CONSTRUCTIONS; EXPONENTIAL CIRCUIT; LOWER BOUNDS; NON-COMMUTATIVE; NON-TRIVIAL; POLYNOMIAL SIZE;

BINARY TREES; POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

EID: 77955255741     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2010.34     Document Type: Conference Paper

References (22)

1. V. Arvind and S. Srinivasan. On the hardness of the noncommutative determinant. ECCC TR09-103, 2009.
2. M. Braverman, S. Cook, P. McKenzie, R. Santhanam and D. Wehr. Pebbles and branching programs for tree evaluation. MFCS, pages 175-186, 2009.
3. P. Burgisser. Completeness and reduction in algebraic complexity theory. Springer-Verlag Berlin Heidelberg 2000.
4. Algebras with polynomial identities and computing the determinant. S. Chien and A. Sinclair. SIAM Journal on Computing 37, pages 252-266, 2007.
5. S. Chein, L. Rasmussen and A. Sinclair. Clifford algebras and approximating the permanent. Journal of Computer and Systems Sciences 67, pages 263-290, 2003.
6. F. R. K. Chung, R. L. Graham and D. Coppersmith. On trees containing all small trees. The Theory of Applications of Graphs, John Wiley and Sons, pages 265-272, 1981.
7. H. Cohn, R. Kleinberg, B. Szegedy and C. Umans. Group-theoretic algorithms for matrix multiplication. FOCS 05', pages 379-388, 2005.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9, pages 251-280, 1990.
9. J. Friedman and N. Pippenger. Expanding graphs contain all small trees. Combinatorica 7(1), pages 71-76, 1987.
10. M. Goldberg and E. Lifshitz. On minimal universal trees. Mat. Zametki 4, pages 371-378, 1968.
11. P. Hrubes, A. Wigderson and A. Yehudayoff. Noncommutative circuits and the sum-of-squares problem. Manuscript, 2009.
12. L. Hyafil. On the parallel evaluation of multivariate polynomials. SIAM J. Comput. 8(2), pages 120-123, 1979.
13. G. Malod and N. Portier. Characterizing Valiant's algebraic complexity classes. J. Complexity 24(1), pages 16-38, 2008.
14. N. Nisan. Lower bounds for non-commutative computation. STOC 91, pages 410-418, 1991.
15. N. Nisan and A. Wigderson. Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity, vol. 6, pages 217-234, 1996.
16. A. A. Razborov and S. Rudich. Natural proofs. STOC 94', pages 204-213, 1994.
17. P. M. Spira. On time-hardware complexity tradeoffs for Boolean functions. 4.Hawaii Symp.on Syst.Sc., 525-527.
18. L. G. Valiant. General context-free recognition in less than cubic time. JCSS 102, pages 308-315, 1975.
19. L. G. Valiant. Completeness classes in algebra. STOC '79, pages 249-261, 1979.
20. L. G. Valiant. Why is Boolean complexity theory difficult? Poceedings of the London Mathematical Society symposium on Boolean function complexity, pages 84-94, 1992.
21. L. G. Valiant and V. V. Vazirani NP is as easy as detecting unique solutions. STOC '85, pages 458463, 1985.
22. L. G. Valiant, S. Skyum, S. Berkowitz and C. Rackoff. Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12(4), pages 641-644, 1983.