Learning Resource Center catalog › Details for: Computers and intractability : a guide to the theory of NP-completeness /

Normal view MARC view ISBD view

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

By: Garey, Michael RContributor(s): Johnson, David S, 1945- [joint author.]Material type: Text

TextSeries: Series of books in the mathematical sciences: Publisher: San Francisco : W.H. Freeman, c1979Description: x, 338 p. : ill. ; 24 cmISBN: 0716710447; 9780716710448; 0716710455 (pbk.); 9780716710455 (pbk.)Subject(s): Computer programming | Computer algorithms | Computational complexityAdditional physical formats: Online version:: Computers and intractability.DDC classification: 519.4 LOC classification: QA76.6 | .G35 1979

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.

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 5 )
Comments ( 0 )

Item type	Current library	Call number	Copy number	Status	Notes	Date due	Barcode
Books	Female Library	QA76.6 .G35 1979 (Browse shelf (Opens below))	1	Available	STACKS		51952000174516
Books	Main Library	QA76.6 .G35 1979 (Browse shelf (Opens below))	1	Available	STACKS		51952000154075

Includes bibliographical references (p. [291]-325).

Includes indexes.

"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.

1 2

There are no comments on this title.

to post a comment.