skip to content
Computers and intractability : a guide to the theory of NP-completeness Preview this item
ClosePreview this item
Checking...

Computers and intractability : a guide to the theory of NP-completeness

Author: Michael R Garey; David S Johnson
Publisher: San Francisco : W.H. Freeman, ©1979.
Series: Series of books in the mathematical sciences.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Garey, Michael R.
Computers and intractability.
San Francisco : W.H. Freeman, ©1979
(OCoLC)716418546
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Michael R Garey; David S Johnson
ISBN: 0716710447 9780716710448 0716710455 9780716710455
OCLC Number: 4195125
Notes: Includes indexes.
Description: x, 338 pages : illustrations ; 24 cm.
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.
Series Title: Series of books in the mathematical sciences.
Other Titles: NP-completeness
Responsibility: Michael R. Garey, David S. Johnson.

Abstract:

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

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/4195125> # Computers and intractability : a guide to the theory of NP-completeness
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "4195125" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/792308187#Place/san_francisco> ; # San Francisco
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/grundlage> ; # Grundlage
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/computer_algorithms> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/computational_complexity> ; # Computational complexity
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/algorithmes> ; # Algorithmes
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/complexite_de_calcul_informatique> ; # Complexité de calcul (Informatique)
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/computer_programming> ; # Computer programming
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/mathematik> ; # Mathematik
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/complejidad_de_calculo_informatica> ; # Complejidad de cálculo (Informática)
   schema:about <http://id.worldcat.org/fast/872390> ; # Computer programming
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/programmation_informatique> ; # Programmation informatique
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/complexiteit> ; # Complexiteit
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/algoritmos> ; # Algoritmos
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/datenverarbeitung> ; # Datenverarbeitung
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/algoritmen> ; # Algoritmen
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/matematica_da_computacao> ; # Matemática da computação
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/np_vollstandiges_problem> ; # NP-vollständiges Problem
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/programacion_de_ordenadores> ; # Programación de ordenadores
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/komplexitat> ; # Komplexität
   schema:about <http://dewey.info/class/519.4/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/792308187#Topic/berechnungskomplexitat> ; # Berechnungskomplexität
   schema:alternateName "NP-completeness" ;
   schema:author <http://viaf.org/viaf/94766987> ; # David S. Johnson
   schema:bookFormat bgn:PrintBook ;
   schema:copyrightYear "1979" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/792308187#Person/garey_michael_r> ; # Michael R. Garey
   schema:datePublished "1979" ;
   schema:description ""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."@en ;
   schema:description "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."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/792308187> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/792308187#Series/series_of_books_in_the_mathematical_sciences> ; # Series of books in the mathematical sciences.
   schema:isSimilarTo <http://www.worldcat.org/oclc/716418546> ;
   schema:name "Computers and intractability : a guide to the theory of NP-completeness"@en ;
   schema:productID "4195125" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/4195125#PublicationEvent/san_francisco_w_h_freeman_1979> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/792308187#Agent/w_h_freeman> ; # W.H. Freeman
   schema:url <http://www.ulb.tu-darmstadt.de/tocs/5617215X.pdf> ;
   schema:workExample <http://worldcat.org/isbn/9780716710455> ;
   schema:workExample <http://worldcat.org/isbn/9780716710448> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/4195125> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/792308187#Person/garey_michael_r> # Michael R. Garey
    a schema:Person ;
   schema:familyName "Garey" ;
   schema:givenName "Michael R." ;
   schema:name "Michael R. Garey" ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Series/series_of_books_in_the_mathematical_sciences> # Series of books in the mathematical sciences.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/4195125> ; # Computers and intractability : a guide to the theory of NP-completeness
   schema:name "Series of books in the mathematical sciences." ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/berechnungskomplexitat> # Berechnungskomplexität
    a schema:Intangible ;
   schema:name "Berechnungskomplexität"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/complejidad_de_calculo_informatica> # Complejidad de cálculo (Informática)
    a schema:Intangible ;
   schema:name "Complejidad de cálculo (Informática)"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/complexite_de_calcul_informatique> # Complexité de calcul (Informatique)
    a schema:Intangible ;
   schema:name "Complexité de calcul (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/computational_complexity> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/computer_algorithms> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/computer_programming> # Computer programming
    a schema:Intangible ;
   schema:name "Computer programming"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/matematica_da_computacao> # Matemática da computação
    a schema:Intangible ;
   schema:name "Matemática da computação"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/np_vollstandiges_problem> # NP-vollständiges Problem
    a schema:Intangible ;
   schema:name "NP-vollständiges Problem"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/programacion_de_ordenadores> # Programación de ordenadores
    a schema:Intangible ;
   schema:name "Programación de ordenadores"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/792308187#Topic/programmation_informatique> # Programmation informatique
    a schema:Intangible ;
   schema:name "Programmation informatique"@en ;
   schema:name "Programmation (Informatique)"@fr ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/872390> # Computer programming
    a schema:Intangible ;
   schema:name "Computer programming"@en ;
    .

<http://viaf.org/viaf/94766987> # David S. Johnson
    a schema:Person ;
   schema:birthDate "1945" ;
   schema:familyName "Johnson" ;
   schema:givenName "David S." ;
   schema:name "David S. Johnson" ;
    .

<http://worldcat.org/isbn/9780716710448>
    a schema:ProductModel ;
   schema:isbn "0716710447" ;
   schema:isbn "9780716710448" ;
    .

<http://worldcat.org/isbn/9780716710455>
    a schema:ProductModel ;
   schema:isbn "0716710455" ;
   schema:isbn "9780716710455" ;
    .

<http://www.worldcat.org/oclc/716418546>
    a schema:CreativeWork ;
   rdfs:label "Computers and intractability." ;
   schema:description "Online version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/4195125> ; # Computers and intractability : a guide to the theory of NP-completeness
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.