Christian Ikenmeyer, Igor Pak, Greta Panova. Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 3573-3586, SIAM, 2023. [doi]
@inproceedings{IkenmeyerPP23,
title = {Positivity of the symmetric group characters is as hard as the polynomial time hierarchy},
author = {Christian Ikenmeyer and Igor Pak and Greta Panova},
year = {2023},
doi = {10.1137/1.9781611977554.ch136},
url = {https://doi.org/10.1137/1.9781611977554.ch136},
researchr = {https://researchr.org/publication/IkenmeyerPP23},
cites = {0},
citedby = {0},
pages = {3573-3586},
booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
publisher = {SIAM},
isbn = {978-1-61197-755-4},
}