𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Diameter of the Pancake Network

✍ Scribed by Mohammad H. Heydari; I.Hal Sudborough


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
310 KB
Volume
25
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis


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. The well known Ε½ . pancake problem concerns the number, f n , of prefix reversals required to sort n pancakes.

Ε½ . We describe a 9r8 n q 2 step sorting sequence for Gates and Papadimitriou's stack of n pancakes, , used for establishing their lower bound, thus disproving n


πŸ“œ SIMILAR VOLUMES


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 diameters of the stars
✍ E. A. Kreiken πŸ“‚ Article πŸ“… 1936 πŸ› John Wiley and Sons 🌐 English βš– 433 KB πŸ‘ 2 views
Researches on the Diameter of Venus
✍ T. J. J. See πŸ“‚ Article πŸ“… 1900 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views
Researches on the diameter of jupiter
✍ T. J. J. See πŸ“‚ Article πŸ“… 1901 πŸ› John Wiley and Sons 🌐 English βš– 253 KB πŸ‘ 2 views