𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the problem of sorting burnt pancakes

✍ Scribed by David S. Cohen; Manuel Blum

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
927 KB
Volume
61
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of the pancake problem
On the complexity of the pancake problem
✍ Fuxiang Yu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 249 KB

## Abstract We study the computational complexity of finding a line that bisects simultaneously two sets in the two‐dimensional plane, called __the pancake problem__, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main resul

On the Diameter of the Pancake Network
On the Diameter of the Pancake Network
✍ Mohammad H. Heydari; I.Hal Sudborough πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 310 KB

The n-dimensional pancake network, P , has processors labeled with each of the n n! distinct permutations of length n and a connection between two processors when the label of one is obtained from the other by some prefix reversal. Each permutation is considered as a stack of different size pancakes