Highly Influenced

# The complexity of computing Kronecker coefficients

@inproceedings{Burgisser2007TheCO, title={The complexity of computing Kronecker coefficients}, author={Peter B̈urgisser and Christian Ikenmeyer}, year={2007} }

- Published 2007

Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group Sn. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur polynomials in the basis of Schur polynomials. We show that the problem KRONCOEFF of computing Kronecker coefficients is very difficult. More specifically, we prove that KRONCOEFF is #P-hard and contained in the complexity class GapP. Formally, this… CONTINUE READING