@article{dmtcs:3622,
    title      = {The complexity of computing Kronecker coefficients},
    author     = {Peter Bürgisser and Christian Ikenmeyer},
    url        = {https://dmtcs.episciences.org/3622},
    doi        = {10.46298/dmtcs.3622},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)},
    issuetitle = {Proceedings},
    eid        = 36,
    year       = {2008},
    month      = {Jan},
    keywords   = {representations of symmetric groups, tensor products, Kronecker coefficients, computational complexity, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}