Positivity of the symmetric group characters is as hard as the polynomial time hierarchy (Q6404697)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Positivity of the symmetric group characters is as hard as the polynomial time hierarchy |
scientific article; zbMATH DE number 7848096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Positivity of the symmetric group characters is as hard as the polynomial time hierarchy |
scientific article; zbMATH DE number 7848096 |
Statements
12 July 2022
0 references
math.CO
0 references
cs.CC
0 references
math.RT
0 references
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy (English)
0 references
