An \((18/11)n\) upper bound for sorting by prefix reversals (Q838149)
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: An (18/11)n upper bound for sorting by prefix reversals |
scientific article; zbMATH DE number 5597934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \((18/11)n\) upper bound for sorting by prefix reversals |
scientific article; zbMATH DE number 5597934 |
Statements
An \((18/11)n\) upper bound for sorting by prefix reversals (English)
0 references
21 August 2009
0 references
pancake problem
0 references
pancake network
0 references
sorting by prefix reversals
0 references
permutations
0 references
upper bounds
0 references
0.8726340532302856
0 references
0.8411281704902649
0 references
0.8279403448104858
0 references
