A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm (Q491961)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6473708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm |
scientific article; zbMATH DE number 6473708 |
Statements
A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm (English)
0 references
19 August 2015
0 references
complexity
0 references
hook-length formula
0 references
Young tableaux
0 references
0.8881813287734985
0 references
0.8595457673072815
0 references
0.7236545085906982
0 references
0.7218284010887146
0 references
0.7191780209541321
0 references
