Garey and Johnson, Computers and Intractability, 1979
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:book
|
| gptkbp:author |
gptkb:David_S._Johnson
gptkb:Michael_R._Garey |
| gptkbp:awarded |
Lester R. Ford Award (1981)
|
| gptkbp:citation |
highly cited
|
| https://www.w3.org/2000/01/rdf-schema#label |
Garey and Johnson, Computers and Intractability, 1979
|
| gptkbp:influenced |
theoretical computer science
|
| gptkbp:ISBN |
978-0716710441
|
| gptkbp:language |
English
|
| gptkbp:notableFor |
comprehensive list of NP-complete problems
|
| gptkbp:publicationYear |
1979
|
| gptkbp:publisher |
gptkb:W._H._Freeman
|
| gptkbp:subject |
gptkb:NP-completeness
computer science theoretical computer science |
| gptkbp:title |
gptkb:Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness
|
| gptkbp:bfsParent |
gptkb:clique_problem
|
| gptkbp:bfsLayer |
7
|