The computational complexity of rules for the character table of \(S_n\). (Q2643536)
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: The computational complexity of rules for the character table of S_n. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of rules for the character table of \(S_n\). |
scientific article |
Statements
The computational complexity of rules for the character table of \(S_n\). (English)
0 references
24 August 2007
0 references
Murnaghan-Nakayama rule
0 references
character tables
0 references
Kazhdan-Lusztig characters
0 references
Hecke algebras
0 references
algorithms
0 references
computational complexities
0 references
Young diagrams
0 references
Young tableaux
0 references
0.7656282782554626
0 references
0.765099823474884
0 references
0.7466999888420105
0 references
0.7445449829101562
0 references
0.742675244808197
0 references
