Computers and intractability : a guide to the theory of NP-completeness /

"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard...

Full description

Bibliographic Details
Main Authors:	Garey, Michael R (Author), Johnson, David S., 1945- (Author)
Format:	Book
Language:	English
Published:	San Francisco : W.H. Freeman, [1979]
Series:	Series of books in the mathematical sciences.
Subjects:	Computer programming. Computer algorithms. Computational complexity. Algorithms Programmation (Informatique) Algorithmes. Complexité de calcul (Informatique) computer programming. algorithms. Programmation informatique. Mathematik Datenverarbeitung Grundlage Komplexität Berechnungskomplexität NP-vollständiges Problem Complexiteit. Algoritmen. Matemática da computação. Algorithms. Berechnungskomplexität. NP-vollständiges Problem. Computational complexity Computer algorithms Computer programming
Online Access:	Table of contents

by Garey, Michael R., Johnson, David S., 1945-
Published 1979

Book