Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Computer Science > Computational Complexity

arXiv:1111.0434 (cs)
[Submitted on 2 Nov 2011 (v1), last revised 10 Nov 2011 (this version, v2)]

Title:Pancake Flipping is Hard

Authors:Laurent Bulteau, Guillaume Fertin, Irena Rusu
View a PDF of the paper titled Pancake Flipping is Hard, by Laurent Bulteau and 2 other authors
View PDF HTML (experimental)
Abstract: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.
Comments: Corrected references
Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
Cite as: arXiv:1111.0434 [cs.CC]
  (or arXiv:1111.0434v2 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.1111.0434
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1007/978-3-642-32589-2_24
DOI(s) linking to related resources

Submission history

From: Laurent Bulteau [view email]
[v1] Wed, 2 Nov 2011 09:30:20 UTC (49 KB)
[v2] Thu, 10 Nov 2011 09:53:22 UTC (49 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Pancake Flipping is Hard, by Laurent Bulteau and 2 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Additional Features

  • Audio Summary

Current browse context:

cs.CC
< prev   |   next >
new | recent | 2011-11
Change to browse by:
cs
cs.DS

References & Citations

  • SciX
  • Google Scholar
  • Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Laurent Bulteau
Guillaume Fertin
Irena Rusu
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)