عنوان
پدید آورنده
موضوع
رده
QA76.6 .G35
QA76
.
6
.
G35
کتابخانه
محل استقرار
INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
0716710447
(Number (ISBN
0716710455
(Number (ISBN
9780716710448
(Number (ISBN
9780716710455
NATIONAL BIBLIOGRAPHY NUMBER
Number
b413671
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
Computers and intractability :
General Material Designation
[Book]
Other Title Information
a guide to the theory of NP-completeness /
First Statement of Responsibility
Michael R. Garey, David S. Johnson
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
x, 338 pages :
Other Physical Details
illustrations ;
Dimensions
24 cm
SERIES
Series Title
Series of books in the mathematical sciences
GENERAL NOTES
Text of Note
Includes indexes
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references (pages 291-325)
CONTENTS NOTE
Text of Note
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
0
SUMMARY OR ABSTRACT
Text of Note
"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
OTHER EDITION IN ANOTHER MEDIUM
Title
Computers and intractability.
PARALLEL TITLE PROPER
Parallel Title
NP-completeness
TOPICAL NAME USED AS SUBJECT
Computational complexity
Computer algorithms
Computer programming
Algoritmos
Complejidad de cálculo (Informática)
Programación de ordenadores
DEWEY DECIMAL CLASSIFICATION
Number
519
.
4
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QA76
.
6
Book number
.
G35
PERSONAL NAME - PRIMARY RESPONSIBILITY
Garey, Michael R
PERSONAL NAME - ALTERNATIVE RESPONSIBILITY
Johnson, David S.,1945-
ORIGINATING SOURCE
Date of Transaction
20160712035932.0
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب [Book]
Y
