Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q938821> ?p ?o }
Showing triples 1 to 60 of
60
with 100 triples per page.
- Q938821 subject Q6543573.
- Q938821 subject Q7313395.
- Q938821 abstract "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). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.".
- Q938821 author Q6830528.
- Q938821 author Q92801.
- Q938821 dcc "519.4".
- Q938821 isbn "0-7167-1045-5".
- Q938821 lcc "QA76.6 .G35".
- Q938821 literaryGenre Q83790.
- Q938821 nonFictionSubject Q21198.
- Q938821 numberOfPages "338".
- Q938821 oclc "247570676".
- Q938821 publisher Q10392775.
- Q938821 wikiPageWikiLink Q10392775.
- Q938821 wikiPageWikiLink Q1050972.
- Q938821 wikiPageWikiLink Q1140200.
- Q938821 wikiPageWikiLink Q12485350.
- Q938821 wikiPageWikiLink Q202843.
- Q938821 wikiPageWikiLink Q205084.
- Q938821 wikiPageWikiLink Q21198.
- Q938821 wikiPageWikiLink Q215206.
- Q938821 wikiPageWikiLink Q2715061.
- Q938821 wikiPageWikiLink Q294284.
- Q938821 wikiPageWikiLink Q3244933.
- Q938821 wikiPageWikiLink Q3738036.
- Q938821 wikiPageWikiLink Q4846249.
- Q938821 wikiPageWikiLink Q5597085.
- Q938821 wikiPageWikiLink Q5633421.
- Q938821 wikiPageWikiLink Q6543573.
- Q938821 wikiPageWikiLink Q6623915.
- Q938821 wikiPageWikiLink Q6830528.
- Q938821 wikiPageWikiLink Q6865406.
- Q938821 wikiPageWikiLink Q7100431.
- Q938821 wikiPageWikiLink Q7313395.
- Q938821 wikiPageWikiLink Q83790.
- Q938821 wikiPageWikiLink Q92801.
- Q938821 wikiPageWikiLink Q92867.
- Q938821 wikiPageWikiLink Q92922.
- Q938821 author "Michael R. Garey and David S. Johnson".
- Q938821 congress "QA76.6 .G35".
- Q938821 dewey "519.4".
- Q938821 genre Q83790.
- Q938821 isbn "0".
- Q938821 name "Computers and Intractability: A Guide to the Theory of NP-Completeness".
- Q938821 oclc "247570676".
- Q938821 pages "x+338".
- Q938821 publisher Q10392775.
- Q938821 subject Q21198.
- Q938821 type Book.
- Q938821 type Book.
- Q938821 type CreativeWork.
- Q938821 type Book.
- Q938821 type Work.
- Q938821 type WrittenWork.
- Q938821 type Thing.
- Q938821 type Q386724.
- Q938821 type Q571.
- Q938821 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).".
- Q938821 label "Computers and Intractability".
- Q938821 name "Computers and Intractability: A Guide to the Theory of NP-Completeness".