## 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
β¦ 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
The complexity of designing a network wi
β
J. Plesnik
π
Article
π
1981
π
John Wiley and Sons
π
English
β 461 KB
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
Researches on the Diameter of Mercury
β
T. J. J. See
π
Article
π
1901
π
John Wiley and Sons
π
English
β 541 KB