The computational complexity of immanants

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 1023-1040

  Bürgisser, Peter ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Algebraic completeness; Computational complexity; Immanants; Permanents

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; TURING MACHINES;

DETERMINANTS; IMMANANTS;

COMPUTATIONAL COMPLEXITY;

EID: 0034947004     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798367880     Document Type: Article

References (24)

1. A. BARVINOK, Computational complexity of immanants and representations of the full linear group, Funct. Anal. Appl., 24 (1990), pp. 144-145.
2. H. BOERNER, Representations of Groups, Elsevier-North Holland, Amsterdam, 1970.
3. P. BÜRGISSER, The computational complexity to evaluate representations of general linear groups, SIAM J. Comput., 30 (2000), pp. 1010-1022.
4. P. BÜRGISSER, Cook's versus Valiant's hypothesis, Theoret. Comput. Sci., 235 (2000), pp. 71-88.
5. P. BÜRGISSER, On the structure of Valiant's complexity classes, Discrete Math. Theor. Comput. Sci., 3 (1999), pp. 73-94.
6. P. BÜRGISSER, Completeness and Reduction in Algebraic Complexity Theory, Algorithms Comput. Math. 7, Springer Verlag, Berlin, 2000.
7. P. BÜRGISSER, M. CLAUSEN, AND M. SHOKROLLAHI, Algebraic Complexity Theory, Grundlehren Math. Wiss. 315, Springer Verlag, New York, 1997.
8. S. COOK, The complexity of theorem proving procedures, in Proceedings of the 3rd ACM Symposium on Theory of Computing, Shaker Heights OH, 1971, pp. 151-158.
9. W. FULTON AND J. HARRIS, Representation Theory, Grad. Texts in Math. 129, Springer Verlag, New York, 1991.
10. J. V. Z. GATHEN, Feasible arithmetic computations: Valiant's hypothesis, J. Symbolic Comput., 4 (1987), pp. 137-172.
11. W. HARTMANN, On the complexity of immanants, Linear and Multilinear Algebra, 18 (1985), pp. 127-140.
12. C. HEPLER, On the Complexity of Computing Characters of Finite Groups, Tech. Report 94/545/14, Dept. of Computer Science, University of Calgary, Canada, 1994.
13. G. JAMES AND A. KERBER, The Representation Theory of the Symmetric Group, Addison-Wesley, Reading, MA, 1981.
14. D. JOHNSON, A catalog of complexity classes, in Handbook of Theoretical Computer Science A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 61-161.
15. R. KARP AND R. LIPTON, Turing machines that take advice, in Logic and Algorithmic: An International Symposium Held in Honor of Ernst Specker, Monographies de L'Enseignement Mathématique 30, L'Enseignement Mathématique, Geneva, 1982, pp. 255-273.
16. D. LITTLEWOOD, The Theory of Group Characters and Matrix Representations of Groups, Oxford University Press, Oxford, UK, 1940.
17. R. MERRIS, On vanishing decomposable symmetrized tensors, Linear and Multilinear Algebra, 5 (1977), pp. 79-86.
18. R. MERRIS, Recent advances in symmetry classes of tensors, Linear and Multilinear Algebra, 7 (1979), pp. 317-328.
19. R. MERRIS, Single-hook characters and Hamiltonian circuits, Linear and Multilinear Algebra, 14 (1983), pp. 21-35.
20. H. J. RYSER, Combinatorial Mathematics, Carus Math. Monogr. 14, Math. Assoc. America, New York, 1963.
21. V. STRASSEN, Algebraic complexity theory, in Handbook of Theoretical Computer Science A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 634-672.
22. L. VALIANT, Completeness classes in algebra, in Proceedings of the 11th ACM Symposium on Theory of Computing, Atlanta, GA, 1979, pp. 249-261.
23. L. VALIANT, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), pp. 189-201.
24. L. VALIANT, Reducibility by algebraic projections, in Logic and Algorithmic: An International Symposium Held in Honor of Ernst Specker, Monographies de L'Enseignement Mathématique 30, L'Enseignement Mathématique, Geneva, 1982, pp. 365-380.