✦ LIBER ✦

The complexity of determinacy problem on group testing

✍ Scribed by Feng Yang; Ding-Zhu Du

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 659 KB
Volume: 28
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90095-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The synchronization problem in protocol

The synchronization problem in protocol testing and its complexity

✍ Sylvia Boyd; Hasan Ural 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 776 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 car sequencing

On the complexity of the car sequencing problem

✍ Tamás Kis 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a su cient condition of membership of NP. We also provide a ps

On the complexity of recursion in proble

On the complexity of recursion in problem-solving

✍ M.C. Er 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 426 KB

The importance of paying attention to the complexity of recursion in problem solving is stressed. Many ill-founded beliefs and doctrines on constructing recursive algorithms are challenged. The Tower of Hanoi problem and its variant are used as concrete examples for illustrating that many seemingly

On the complexity of the extreme points

On the complexity of the extreme points decision problem

✍ Xiaodong Wang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 621 KB

On complexity of the word problem in bra

On complexity of the word problem in braid groups and mapping class groups

✍ Hessam Hamidi-Tehrani 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 350 KB

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry