cover image

Computers and intractability : a guide to the theory of NP-completeness / Michael R. Garey, David S. Johnson.

; Johnson, David S., 1945- author
San Francisco : W.H. Freeman, [1979] .
ISBN 9780716710455, 0716710455, 9780716710448, 0716710447

Location Call Number Status Consortium Loan
George Washington
Gelman stacks
QA 76.6 .G35 (show me on map) Available Request
American
LIB stacks
QA76.6 .G34 Available Request
Gallaudet
UNIV General stacks
519.4 G3c, 1979 Available Request
George Mason
Fenwick stacks
QA76.6 .G35 Available Request
Georgetown
Science stacks
QA76.6 .G35 Available Request
Howard
Founders Library stacks
QA76.6 .G35 Available Request
Founders Library stacks
QA76.6 .G35 Missing Request
Other Title NP-completeness
Other Authors Johnson, David S., 1945-
Subjects Algorithmes.
Algoritmen.
Algoritmos.
Berechnungskomplexität.
Complejidad de cálculo (Informática)
Complexiteit.
Complexité de calcul (Informatique)
Computational complexity.
Computer algorithms.
Computer programming.
Datenverarbeitung.
Grundlage.
Komplexität.
Matemática da computação.
Mathematik.
NP-vollständiges Problem.
Programación de ordenadores.
Programmation (Informatique)
Programmation informatique.
Series Series of books in the mathematical sciences.
Description x, 338 pages : illustrations ; 24 cm.
Copyright Date [1979]
©1979
Notes Includes indexes.
Includes bibliographical references (pages 291-325).
Summary "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 problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"--Back cover.
Contents 1. Computers, complexity, and intractability -- 2. The theory of NP-completeness -- 3. Proving NP-completeness results -- 4. Using NP-completeness to analyze problems -- 5. NP-hardness -- 6. Coping with NP-complete problems -- 7. Beyond NP-completeness -- Appendix: A list of NP-complete problems.
Network Numbers (OCoLC)4195125
(OCoLC)ocm04195125
WorldCat Search OCLC WorldCat
WorldCat Identities Garey, Michael R.
Publication timeline, list of works, related names and subjects and other information

Services

Export citation to: RefWorks