On the complexity of computing Kronecker coefficients
- 2 September 2015
- journal article
- Published by Springer Nature in computational complexity
- Vol. 26 (1) , 1-36
Abstract
No abstract availableKeywords
All Related Versions
This publication has 41 references indexed in Scilit:
- The stability of the Kronecker product of Schur functionsJournal of Algebra, 2011
- The status of the P versus NP problemCommunications of the ACM, 2009
- On the Computation of Clebsch–Gordan Coefficients and the Dilation EffectExperimental Mathematics, 2006
- Combinatorics and geometry of Littlewood–Richardson conesEuropean Journal of Combinatorics, 2005
- Effective lattice point counting in rational convex polytopesJournal of Symbolic Computation, 2004
- A formula for the Kronecker products of Schur functions of hook shapesJournal of Algebra, 1989
- Tensorprodukte von Charakteren der symmetrischen GruppeArchiv der Mathematik, 1977
- Products and Plethysms of Characters with Orthogonal, Symplectic and Symmetric GroupsCanadian Journal of Mathematics, 1958
- The Kronecker Product of Symmetric Group RepresentationsJournal of the London Mathematical Society, 1956
- The Analysis of the Direct Product of Irreducible Representations of the Symmetric GroupsAmerican Journal of Mathematics, 1938