Pancake Flipping Is Hard
Pancake Flipping is the problem of sorting a stack of pancakes of different sizes (that is, a permutation), when the only allowed operation is to insert a spatula anywhere in the stack and to flip the pancakes above it (that is, to perform a prefix reversal). In the burnt variant, one side of each pancake is marked as burnt, and it is required to finish with all pancakes having the burnt side down. Computing the optimal scenario for any stack of pancakes and determining the worst-case stack for any stack size have been challenges over more than three decades. Beyond being an intriguing combinatorial problem in itself, it also yields applications, e.g. in parallel computing and computational biology.
In this paper, we show that the Pancake Flipping problem, in its original (unburnt) variant, is NP-hard, thus answering the long-standing question of its computational complexity.
KeywordsPancake problem Computational complexity Permutations Prefix reversals
Unable to display preview. Download preview PDF.
- 1.Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. In: FOCS, pp. 148–157. IEEE (1993)Google Scholar
- 7.Dweighter, H. American Mathematics Monthly, 82(1) (1975): (pseudonym of Goodman, J.E.)Google Scholar
- 10.Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: STOC, pp. 178–189. ACM (1995)Google Scholar
- 11.Heydari, M., Sudborough, I.: On Sorting by Prefix Reversals and the Diameter of Pancake Networks. In: Meyer auf der Heide, F., Rosenberg, A.L., Monien, B. (eds.) Heinz Nixdorf Symposium 1992. LNCS, vol. 678, pp. 218–227. Springer, Heidelberg (1993)Google Scholar