On the complexity of the pancake problem

DOI10.1016/J.ENTCS.2006.08.009MaRDI QIDQ4921438zbMATH OpenOpenAlexFDO

Authors Fuxiang Yu

Publication date 10 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.08.009

zbMATH Keywords

\#Pcomplexity theory of real functionscomputational complexitypancake problem

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Dissections and valuations (Hilbert's third problem, etc.) (52B45) Computational aspects related to convexity (52B55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of the pancake problem
• On the problem of sorting burnt pancakes
• On the Diameter of the Pancake Network

Cites work

• Algorithms for ham-sandwich cuts
• Bisections and ham-sandwich cuts of convex polygons and polyhedra
• Computational Complexity of Two-Dimensional Regions
• Computing a ham-sandwich cut in two dimensions
• Dynamic ham-sandwich cuts in the plane
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 803199 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)
• The power of the middle bit of a \(\#\)P function

Cited in

(1)

• On the complexity of the pancake problem

This page was built for publication: On the complexity of the pancake problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921438)