An Entity of Type: work, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Book

Property Value
dbo:author
dbo:dcc
  • 519.4
dbo:description
  • book (en)
  • বই (bn)
  • ספר (iw)
  • գիրք (hy)
  • libër (sq)
  • книга (uk)
  • Fachbuch von Michael Garey und David S. Johnson (de)
  • boek van Michael Garey (nl)
  • libro de Michael Garey (es)
  • livre de Michael Garey, David S. Johnson (fr)
  • كتاب من تأليف دايفيد جونسون (ar)
dbo:isbn
  • 0-7167-1045-5
dbo:lcc
  • QA76.6 .G35
dbo:literaryGenre
dbo:nonFictionSubject
dbo:numberOfPages
  • 338 (xsd:positiveInteger)
dbo:oclc
  • 247570676
dbo:publisher
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:author
  • Michael R. Garey and David S. Johnson (en)
dbp:congress
  • QA76.6 .G35 (en)
dbp:country
  • United States (en)
dbp:dewey
  • 519.400000 (xsd:double)
dbp:genre
dbp:isbn
  • 0 (xsd:integer)
dbp:language
  • English (en)
dbp:mediaType
  • Print (en)
dbp:name
  • Computers and Intractability: A Guide to the Theory of NP-Completeness (en)
dbp:oclc
  • 247570676 (xsd:integer)
dbp:pages
  • x+338 (en)
dbp:pubDate
  • 1979 (xsd:integer)
dbp:publisher
dbp:series
  • A Series of Books in the Mathematical Sciences (en)
dbp:subject
dbp:wikiPageUsesTemplate
dc:publisher
  • W. H. Freeman and Company
dct:subject
gold:hypernym
rdf:type
rdfs:label
  • Computers and Intractability (en)
  • Computers and Intractability: A Guide to the Theory of NP-Completeness (es)
  • Computers and Intractability: A Guide to the Theory of NP-Completeness (ko)
  • Computers and Intractability (pt)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
foaf:name
  • Computers and Intractability: A Guide to the Theory of NP-Completeness (en)
is dbo:knownFor of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International