The Computational Complexity of Immanants

DOI10.1137/S0097539798367880MaRDI QIDQ4507383zbMATH OpenOpenAlexFDO

Authors Peter Bürgisser

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539798367880

zbMATH Keywords

algebraic completenesscomputational complexitydeterminantsimmanantspermanentsYoung diagrams

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On the complexity of immanants
• Computational complexity of immanents and representations of the full linear group
• Determinant versus permanent: salvation via generalization?
• Completeness and reduction in algebraic complexity theory
• Algebraic complexity theory. III: On the complexity of the computation of permanents

Cited in

(10)

• Converting immanants on skew-symmetric matrices
• Sum rules in multiphoton coincidence rates
• scientific article; zbMATH DE number 5839812 (Why is no real title available?)
• The complexity of the fermionant and immanants of constant width
• Single-hook immanants for complete graphs
• On the complexity of immanants
• Determinant versus permanent: salvation via generalization?
• On the second immanantal polynomials of graphs
• \#P-hardness proofs of matrix immanants evaluated on restricted matrices
• An efficient tree decomposition method for permanents and mixed discriminants

This page was built for publication: The Computational Complexity of Immanants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507383)