The computational complexity of rules for the character table of \(S_n\). (Q2643536): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
