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...
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
San Francisco :
W.H. Freeman,
[1979]
|
| Series: | Series of books in the mathematical sciences.
|
| Subjects: | |
| Online Access: | Table of contents |
| 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. |
|---|---|
| Item Description: | Includes indexes. |
| Physical Description: | x, 338 pages : illustrations ; 24 cm |
| Bibliography: | Includes bibliographical references (pages 291-325). |
| ISBN: | 0716710447 9780716710448 0716710455 9780716710455 |