On the complexity of immanants

DOI10.1080/03081088508817680MaRDI QIDQ3727248zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1985

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081088508817680

zbMATH Keywords

complexitydeterminantGaussian eliminationimmanentpolynomial algorithm

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computational complexity of immanents and representations of the full linear group
• The Computational Complexity of Immanants
• Converting immanants on singular symmetric matrices
• An Algorithm for the Second Immanant
• Immanants

Cites work

• On vanishing decomposable symmetrized tensors^†
• Recent advances in symmetry classes of tensors^†
• Single-hook characters and hamiltonian circuits^∗
• The complexity of computing the permanent

Cited in

(12)

• Immanants and finite point processes
• Sum rules in multiphoton coincidence rates
• The complexity of the fermionant and immanants of constant width
• An Algorithm for the Second Immanant
• Single-hook immanants for complete graphs
• Immanants
• The Computational Complexity of Immanants
• Vanishing immanants
• A generalization of immanants based on partition algebra characters
• \#P-hardness proofs of matrix immanants evaluated on restricted matrices
• Almost all trees are co-immanantal
• Computational complexity of immanents and representations of the full linear group

This page was built for publication: On the complexity of immanants

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