✦ LIBER ✦

On Complexity of the Subpattern Problem

✍ Scribed by Ahal, Shlomo; Rabinovich, Yuri

Book ID: 118197232
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 292 KB
Volume: 22
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480104444776

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Pancake Problem

✍ Fuxiang Yu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 408 KB

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 complexity of the highway problem

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

On the complexity of the dualization pro

On the complexity of the dualization problem

✍ Djukova, E. V.; Sotnezov, R. M. 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 239 KB