Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
Attributed to:
Algebraic complexity theory via the algebraic geometry and representation theory of generalised continued fractions
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611977554.ch136
Publication URI: http://dx.doi.org/10.1137/1.9781611977554.ch136
Type: Book Chapter
Book Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2023)
Page Reference: 3573-3586