✦ LIBER ✦

On the Complexity of the Pancake Problem

✍ Scribed by Fuxiang Yu

Book ID: 108126724
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 408 KB
Volume: 167
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.08.009

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

## 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 problem of sorting burnt pancakes

✍ David S. Cohen; Manuel Blum 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 927 KB

On Complexity of the Subpattern Problem

✍ Ahal, Shlomo; Rabinovich, Yuri 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 292 KB

On the Complexity of the Steiner Problem

✍ M. Brazil; D.A. Thomas; J.F. Weng 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 63 KB

On the complexity of the marriage proble

On the complexity of the marriage problem

✍ L.H Harper; J.E Savage 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 665 KB

On the complexity of the highway problem

✍ Elbassioni, Khaled; Raman, Rajiv; Ray, Saurabh; Sitters, René 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 358 KB