On the complexity of immanants

DOI10.1080/03081088508817680zbMath0595.65038OpenAlexW2080097826WikidataQ126250707 ScholiaQ126250707MaRDI QIDQ3727248

No author found.

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

complexityGaussian eliminationdeterminantpolynomial algorithmimmanent

Mathematics Subject Classification ID

Related Items (4)

Sum rules in multiphoton coincidence rates ⋮ Computational complexity of immanents and representations of the full linear group ⋮ Almost all trees are co-immanantal ⋮ Immanants and finite point processes

Cites Work

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

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