The Computational Complexity of Immanants

DOI10.1137/S0097539798367880zbMath0979.65038OpenAlexW2054497025MaRDI QIDQ4507383

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

computational complexitydeterminantspermanentsYoung diagramsalgebraic completenessimmanants

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)

Related Items (3)

An efficient tree decomposition method for permanents and mixed discriminants ⋮ Sum rules in multiphoton coincidence rates ⋮ Converting immanants on skew-symmetric matrices

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