Skip to Main content Skip to Navigation
Journal articles

Polynomial-time sortable stacks of burnt pancakes

Abstract : Pancake flipping, a famous open problem in computer science, can be formalised as the problem of sorting a permutation of positive integers using as few prefix reversals as possible. In that context, a prefix reversal of length k reverses the order of the first k elements of the permutation. The burnt variant of pancake flipping involves permutations of signed integers, and reversals in that case not only reverse the order of elements but also invert their signs. Although three decades have now passed since the first works on these problems, neither their computational complexity nor the maximal number of prefix reversals needed to sort a permutation is yet known. In this work, we prove a new lower bound for sorting burnt pancakes, and show that an important class of permutations, known as "simple permutations", can be optimally sorted in polynomial time.
Document type :
Journal articles
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Anthony Labarre Connect in order to contact the contributor
Submitted on : Friday, September 7, 2012 - 8:58:20 AM
Last modification on : Wednesday, November 10, 2021 - 5:38:03 PM
Long-term archiving on: : Saturday, December 8, 2012 - 3:39:56 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00728920, version 1



Anthony Labarre, Josef Cibulka. Polynomial-time sortable stacks of burnt pancakes. Theoretical Computer Science, Elsevier, 2011, 412 (8-10), pp.695-702. ⟨hal-00728920⟩



Record views


Files downloads