Complete problems for valiant’s class of qp-computable families of polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 1-10

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

ADJOINT MATRIX; COMPLETE PROBLEMS; MATRIX PRODUCTS; MULTIVARIATE POLYNOMIAL; QUASI-POLY-NOMIAL;

MATRIX ALGEBRA;

EID: 84944072133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_1     Document Type: Conference Paper

References (11)

1. Michael Ben-Or and Richard Cleve. Computing algebraic formulas using a constant number of registers. SIAM J. Comput., 21(1):54–58, 1992.
2. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc., 21:1–46, 1989.
3. Peter Burgisser. Completeness and Reduction in Algebraic ComplexityTheory. Springer, 2000.
4. Peter Burgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.
5. Stephen A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Computation, 64:2–22, 1985.
6. Joachim von zur Gathen. Feasible arithmetic computations: Valiant’s hypothesis. J. Symbolic Comput., 4:137–172, 1987.
7. Laurent Hyafil. On the parallel evaluation of multivariate polynomials. SIAM J. Comput., 8(2):120–123, 1979.
8. Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. SIAM J. Comput., 17(4):686–695, 1988.
9. L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast parallel computation of polynomials using few processors. SIAM J. Comput., 12(4):641–644, 1983.
10. Leslie G. Valiant. Completeness classes in algebra. In Proc. 11th Int. ACM Symp. on Theoryof Computing (STOC), pages 249–261, 1979.
11. Leslie G. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci., 8:189–201, 1979.