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

Christian Ikenmeyer Igor Pak Greta Panova

Published in: SODA (2023)

Keyphrases

special case
worst case
approximation algorithms
computational complexity
hierarchical structure
np hardness
decision trees
lower bound
scale spaces
polynomial size