The Computational Complexity to Evaluate Representations of General Linear Groups

DOI10.1137/S0097539798367892MaRDI QIDQ4507382zbMATH OpenFDO

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/S0097539798367892

zbMATH Keywords

completenessfast algorithmsGelfand-Tsetlin basesimmanantslower boundsrepresentations of general linear groupsspecial functions

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Applications of Lie groups to the sciences; explicit representations (22E70) Spherical harmonics (33C55) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computational complexity of immanents and representations of the full linear group
• scientific article; zbMATH DE number 67384
• Complexity and computation in matrix groups.
• On the parallel complexity of linear groups
• scientific article; zbMATH DE number 1534404
• Complexity theory for Lie-group solvers
• Computing Irreducible Representations of Finite Groups
• scientific article; zbMATH DE number 919272
• scientific article; zbMATH DE number 1302482
• On the computational complexity of the theory of Abelian groups

Cited in

(3)

• Sum rules in multiphoton coincidence rates
• On the parallel complexity of linear groups
• Computational complexity of immanents and representations of the full linear group

This page was built for publication: The Computational Complexity to Evaluate Representations of General Linear Groups

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