Borrow it
- African Studies Library
- Alumni Medical Library
- Astronomy Library
- Fineman and Pappas Law Libraries
- Frederick S. Pardee Management Library
- Howard Gotlieb Archival Research Center
- Mugar Memorial Library
- Music Library
- Pikering Educational Resources Library
- School of Theology Library
- Science & Engineering Library
- Stone Science Library
The Resource Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson
Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson
Resource Information
The item Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
- 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
- Language
- eng
- Extent
- x, 338 pages
- Note
- Includes indexes
- 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
- Isbn
- 9780716710455
- Label
- Computers and intractability : a guide to the theory of NP-completeness
- Title
- Computers and intractability
- Title remainder
- a guide to the theory of NP-completeness
- Statement of responsibility
- Michael R. Garey, David S. Johnson
- Title variation
- NP-completeness
- Subject
-
- Algoritmos
- Berechnungskomplexität
- Complejidad de cálculo (Informática)
- Complexiteit
- Complexité de calcul (Informatique)
- Computational complexity
- Computational complexity
- Computational complexity
- Computer algorithms
- Computer algorithms
- Computer algorithms
- Computer programming
- Computer programming
- Computer programming
- Datenverarbeitung
- Grundlage
- Komplexität
- Matemática da computação
- Mathematik
- NP-vollständiges Problem
- Programación de ordenadores
- Programmation (Informatique)
- Programmation informatique
- Algorithmes
- Algoritmen
- Language
- eng
- 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
- Cataloging source
- DLC
- http://library.link/vocab/creatorName
- Garey, Michael R
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA76.6
- LC item number
- .G35
- Literary form
- non fiction
- Nature of contents
- bibliography
- http://library.link/vocab/relatedWorkOrContributorDate
- 1945-
- http://library.link/vocab/relatedWorkOrContributorName
- Johnson, David S.
- Series statement
- A Series of books in the mathematical sciences
- http://library.link/vocab/subjectName
-
- Computer programming
- Computer algorithms
- Computational complexity
- Algoritmos
- Programación de ordenadores
- Complejidad de cálculo (Informática)
- Programmation (Informatique)
- Algorithmes
- Complexité de calcul (Informatique)
- Programmation informatique
- Computational complexity
- Computer algorithms
- Computer programming
- Complexiteit
- Algoritmen
- Datenverarbeitung
- Grundlage
- Komplexität
- Mathematik
- Matemática da computação
- Berechnungskomplexität
- NP-vollständiges Problem
- Label
- Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson
- Note
- Includes indexes
- Bibliography note
- Bibliography: p. [291]-325
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- 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
- Dimensions
- 24 cm.
- Extent
- x, 338 pages
- Isbn
- 9780716710455
- Lccn
- 78012361
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other control number
- 9780716710455
- Other physical details
- illustrations
- System control number
- (OCoLC)4195125
- Label
- Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson
- Note
- Includes indexes
- Bibliography note
- Bibliography: p. [291]-325
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- 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
- Dimensions
- 24 cm.
- Extent
- x, 338 pages
- Isbn
- 9780716710455
- Lccn
- 78012361
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other control number
- 9780716710455
- Other physical details
- illustrations
- System control number
- (OCoLC)4195125
Subject
- Algoritmos
- Berechnungskomplexität
- Complejidad de cálculo (Informática)
- Complexiteit
- Complexité de calcul (Informatique)
- Computational complexity
- Computational complexity
- Computational complexity
- Computer algorithms
- Computer algorithms
- Computer algorithms
- Computer programming
- Computer programming
- Computer programming
- Datenverarbeitung
- Grundlage
- Komplexität
- Matemática da computação
- Mathematik
- NP-vollständiges Problem
- Programación de ordenadores
- Programmation (Informatique)
- Programmation informatique
- Algorithmes
- Algoritmen
Member of
Related
Library Locations
-
African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 -71.105717
-
Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 -71.107023
-
Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 -71.099547
-
Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 -71.108227
-
Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 -71.101425
-
School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 -71.107235
-
Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 -71.102257
-
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Computers-and-intractability--a-guide-to-the/z3Ua3u_ezs4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Computers-and-intractability--a-guide-to-the/z3Ua3u_ezs4/">Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Computers-and-intractability--a-guide-to-the/z3Ua3u_ezs4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Computers-and-intractability--a-guide-to-the/z3Ua3u_ezs4/">Computers and intractability : a guide to the theory of NP-completeness, Michael R. Garey, David S. Johnson</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
