Polynomial-time sortable stacks of burnt pancakes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100844" target="_blank" >RIV/00216208:11320/11:10100844 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2010.11.004" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2010.11.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2010.11.004" target="_blank" >10.1016/j.tcs.2010.11.004</a>
Alternative languages
Result language
angličtina
Original language name
Polynomial-time sortable stacks of burnt pancakes
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GD201%2F09%2FH057" target="_blank" >GD201/09/H057: Res Informatica</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
412
Issue of the periodical within the volume
8
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
695-702
UT code for WoS article
000287295000007
EID of the result in the Scopus database
—