## 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 complexity of the extreme points decision problem
β Scribed by Xiaodong Wang
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 621 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the complexity of the pancake problem
β
Fuxiang Yu
π
Article
π
2007
π
John Wiley and Sons
π
English
β 249 KB
An extremal problem of orthants containi
β
Yoshiyasu Ishigami
π
Article
π
1994
π
Elsevier Science
π
English
β 196 KB
Let d, n be positive integers, and P a set of n points in the d-dimensional Euclidean space.
On the Extremal Aspect of the Frobenius
β
Vsevolod F. Lev
π
Article
π
1996
π
Elsevier Science
π
English
β 347 KB
concerning the well-known diophantine problem of Frobenius was given an exact solution for linear forms with the set of coefficients of density 1 2 (or more). In the present paper, we advance this up to the density 1 3 .
The decision-tree complexity of element
β
Ravi B. Boppana
π
Article
π
1994
π
Elsevier Science
π
English
β 216 KB
Polynomial approximation using equioscil
β
G.M Phillips; P.J Taylor
π
Article
π
1982
π
Elsevier Science
π
English
β 237 KB
On the Parallel Complexity of the Polyno
β
Peter BΓΌrgisser
π
Article
π
1998
π
Elsevier Science
π
English
β 457 KB