The computational complexity of immanants

被引：0
|
作者：
Bürgisser, P. [1 ]
机构：
[1] Dept. of Math. and Computer Science, University of Paderborn, Warburger Str. 100, D-33098 Paderborn, Germany
来源：
| 2001年 / Society for Industrial and Applied Mathematics Publications卷 / 30期
关键词：
Algorithms - Mathematical models - Matrix algebra - Polynomials - Turing machines;
D O I：
10.1137/S0097539798367880
中图分类号：
学科分类号：
摘要：
Permanents and determinants are special cases of immanants. The latter are polynomial matrix functions defined in terms of characters of symmetric groups and corresponding to Young diagrams. Valiant has proved that the evaluation of permanents is a complete problem in both the Turing machine model (#P-completeness) as well as in his algebraic model (VNP-completeness). We show that the evaluation of immanants corresponding to hook diagrams or rectangular diagrams of polynomially growing width is both #P-complete and VNP-complete.
引用
收藏
相关论文
共 50 条
  • [41] Computational complexity theory
    Loui, MC
    ACM COMPUTING SURVEYS, 1996, 28 (01) : 47 - 49
  • [42] The Computational Complexity Column
    Koucký, Michal
    Bulletin of the European Association for Theoretical Computer Science, 2021, 2021 (135):
  • [43] Computational complexity of functions
    Levin, LA
    THEORETICAL COMPUTER SCIENCE, 1996, 157 (02) : 267 - 271
  • [44] Theory of computational complexity
    Zilinskas, A
    INTERFACES, 2002, 32 (03) : 93 - 94
  • [45] Mitosis in computational complexity
    Glasser, Christian
    Pavan, A.
    Selman, Alan L.
    Zhang, Liyu
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 61 - 67
  • [46] Implicit computational complexity
    Marion, JY
    THEORETICAL COMPUTER SCIENCE, 2004, 318 (1-2) : 1 - 1
  • [47] Computational complexity simplified
    Tarek, Ahmed
    RECENT ADVANCES ON APPLIED MATHEMATICS: PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS (MATH '08), 2008, : 130 - 135
  • [48] The computational complexity of RaceTrack
    Institut für Informatik, Universität Giessen, Arndtstraße 2, D-35392 Giessen, Germany
    不详
    Lect. Notes Comput. Sci., 1600, (260-271):
  • [49] ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS
    Merekin, Yu. V.
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2009, 2 (04) : 649 - 656
  • [50] Computational Social Choice and Computational Complexity: BFFs?
    Hemaspaandra, Lane A.
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 7971 - 7977
12345