| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334504 | Theoretical Computer Science | 2009 | 19 Pages |
Abstract
The pancake problem asks for the minimum number of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+O(1)â(1.6363)n.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
B. Chitturi, W. Fahle, Z. Meng, L. Morales, C.O. Shields, I.H. Sudborough, W. Voit,