Some Completeness Results on Decision Trees and Group Testing

Guardado en:

Detalles Bibliográficos
Publicado en:	SIAM Journal on Matrix Analysis and Applications vol. 8, no. 4 (Oct 1987), p. 762
Autor principal:	Du, Ding-Zhu
Otros Autores:	Ko, Ker-I
Publicado:	Society for Industrial and Applied Mathematics
Materias:	Algorithms Decision trees Queries Games
Acceso en línea:	Citation/Abstract Full Text - PDF
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Descripción
Resumen:	The computational complexity of the group testing problem is investigated under the minimax measure and the decision tree model. We consider the generalizations of the group testing problem in which partial information about the decision tree of the problem is given. Using this approach, we demonstrate the NP-hardness of several decision problems related to various models of the group testing problem. For example, we show that, for several models of group testing, the problem of recognizing a set of queries that uniquely determines each object is co-NP-complete.
ISSN:	0895-4798 1095-7162
DOI:	10.1137/0608062
Fuente:	ABI/INFORM Global