Garey and Johnson: Computers and Intractability
E679895
"Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Computers and Intractability: A Guide to the Theory of NP-Completeness | 1 |
| Garey and Johnson: Computers and Intractability canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7666079 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Garey and Johnson: Computers and Intractability Context triple: [NP-completeness, centralReference, Garey and Johnson: Computers and Intractability]
-
A.
"Reducibility Among Combinatorial Problems" (1972)
"Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
-
B.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
C.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
D.
Cook–Levin theorem
The Cook–Levin theorem is a foundational result in computational complexity theory that established the Boolean satisfiability problem (SAT) as the first NP-complete problem, launching the theory of NP-completeness.
-
E.
NP-completeness
NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Garey and Johnson: Computers and Intractability Target entity description: "Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
-
A.
"Reducibility Among Combinatorial Problems" (1972)
"Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
-
B.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
C.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
D.
Cook–Levin theorem
The Cook–Levin theorem is a foundational result in computational complexity theory that established the Boolean satisfiability problem (SAT) as the first NP-complete problem, launching the theory of NP-completeness.
-
E.
NP-completeness
NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
textbook ⓘ theoretical computer science literature ⓘ |
| author |
David S. Johnson
NERFINISHED
ⓘ
Michael R. Garey NERFINISHED ⓘ |
| canonicalAbbreviation | G&J NERFINISHED ⓘ |
| citationFrequency | high ⓘ |
| countryOfPublication |
United States of America
ⓘ
surface form:
United States
|
| coversConcept |
NP class
ⓘ
NP-complete problems ⓘ NP-hard problems ⓘ P class ⓘ polynomial-time reduction ⓘ reduction between decision problems ⓘ |
| field | computer science ⓘ |
| focus | worst-case complexity ⓘ |
| hasSection |
catalog of NP-complete problems
ⓘ
introduction to computational complexity ⓘ techniques for proving NP-completeness ⓘ |
| influenced |
computer science education
ⓘ
design and analysis of algorithms ⓘ research in computational complexity theory ⓘ |
| language | English ⓘ |
| notableFor |
comprehensive catalog of NP-complete problems
ⓘ
formalization of polynomial-time reductions ⓘ systematic development of NP-completeness theory ⓘ |
| publicationYear | 1979 ⓘ |
| publisher | W. H. Freeman and Company NERFINISHED ⓘ |
| relatedTo |
Cook–Levin theorem
NERFINISHED
ⓘ
Karp’s 21 NP-complete problems NERFINISHED ⓘ P versus NP problem NERFINISHED ⓘ |
| shortTitle | Garey and Johnson NERFINISHED ⓘ |
| status | classic in theoretical computer science ⓘ |
| subfield |
computational complexity
ⓘ
theoretical computer science ⓘ |
| subject |
NP-completeness
NERFINISHED
ⓘ
P versus NP NERFINISHED ⓘ algorithmic intractability ⓘ complexity classes ⓘ computational complexity theory ⓘ decision problems ⓘ reduction techniques ⓘ |
| timeComplexityModel | Turing machine model ⓘ |
| typicalCourseUsage |
complexity theory courses
ⓘ
theory of computation courses ⓘ |
| usedAs |
graduate-level textbook
ⓘ
reference work ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Garey and Johnson: Computers and Intractability Description of subject: "Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Computers and Intractability: A Guide to the Theory of NP-Completeness