This HTML5 document contains 12 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
n7http://dbpedia.org/resource/W._H.
dbpedia-owlhttp://dbpedia.org/ontology/
n5http://dbpedia.org/resource/David_S.
foafhttp://xmlns.com/foaf/0.1/
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:Computers_and_Intractability
rdfs:comment
In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson.It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book).
foaf:name
Computers and Intractability: A Guide to the Theory of NP-Completeness
dbpedia-owl:author
dbpedia:Michael_Garey n5:_Johnson
dbpedia-owl:dcc
519.4
dbpedia-owl:isbn
0-7167-1045-5
dbpedia-owl:lcc
QA76.6 .G35
dbpedia-owl:literaryGenre
dbpedia:Textbook
dbpedia-owl:nonFictionSubject
dbpedia:Computer_science
dbpedia-owl:numberOfPages
338
dbpedia-owl:oclc
247570676
dbpedia-owl:publisher
n7:_Freeman_and_Company