The computational complexity of rules for the character table of \(S_n\). (Q2643536)

From MaRDI portal
Revision as of 12:25, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references