The complexity of computing Kronecker coefficients

@inproceedings{Burgisser2007TheCO,
  title={The complexity of computing Kronecker coefficients},
  author={Peter B̈urgisser and Christian Ikenmeyer},
  year={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

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Counting complexity. In Complexity theory retrospective, II, pages 81–107

  • Lance Fortnow
  • 1997
Highly Influential
6 Excerpts

Mulmuley and Milind Sohoni . Geometric complexity theory . I . An approach to the P vs . NP and related problems

  • D. Ketan
  • SIAM J . Comput .
  • 2007

Mulmuley and Milind Sohoni . Geometric complexity theory II : Towards explicit obstructions for embeddings among class varieties

  • D. Ketan
  • 2006

Mulmuley and Milind Sohoni . Geometric complexity theory III : On deciding positivity of LittlewoodRichardson coefficients

  • D. ChristianIkenmeyerKetan
  • 2005

Similar Papers

Loading similar papers…