Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Garey and Johnson: Computers and Intractability | Statement: [NP-completeness, centralReference, Garey and Johnson: Computers and Intractability]

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.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Garey and Johnson: Computers and Intractability
Triple: [NP-completeness, centralReference, Garey and Johnson: Computers and Intractability]

"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.

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

Target predicate: centralReference
Context triple: [NP-completeness, centralReference, Garey and Johnson: Computers and Intractability]

• A. primaryReference chosen
  Indicates that one entity serves as the main or authoritative source of information or citation for another entity.
• B. centralIn
  Indicates that one entity occupies a central or most important position within another entity, context, or structure.
• C. centralBranch
  Indicates that one entity functions as the main or primary branch within a larger organizational or structural system relative to another entity.
• D. primaryReferent
  Indicates that one entity is the main or most salient referent associated with another entity among potentially multiple candidates.
• E. centralLocation
  Indicates that one entity serves as the primary or central place associated with another entity.
• F. None of above.