An \((18/11)n\) upper bound for sorting by prefix reversals (Q838149)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \((18/11)n\) upper bound for sorting by prefix reversals |
scientific article |
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
