Descripción

Ejemplar nuevo. A wide variety of commonly encountered problems for mathematics, computer science, and operations research are known to be NP-complete, and the collection of such problems continues to grow almost daily. Indeed, the NP-complete problems are now so pervasive that it is important for anyone concerned with the computational aspects of these fields to be familiar with the meaning and implications of this concept. This book is intended as a detailed guide to the theory of NP-Completeness, emphasizing those concepts and techniques that seem to be most useful for applying theory to practical problems