Positivity of the symmetric group characters is as hard as the polynomial time hierarchy

DOI10.1137/1.9781611977554.ch136arXiv2207.05423OpenAlexW4316652344MaRDI QIDQ6404697

Igor Pak, Christian Ikenmeyer, Greta Panova

Publication date: 12 July 2022

Full work available at URL: https://doi.org/10.1137/1.9781611977554.ch136

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Positivity of the symmetric group characters is as hard as the polynomial time hierarchy