Positivity of the symmetric group characters is as hard as the polynomial time hierarchy - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Christian Ikenmeyer' in GoogleThis author has not been identified. Look up 'Igor Pak' in GoogleThis author has not been identified. Look up 'Greta Panova' in Google

runs on WebDSL