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: Papadimitriou–Yannakakis theorem | Statement: [Christos H. Papadimitriou, knownFor, Papadimitriou–Yannakakis theorem]

Target entity: Papadimitriou–Yannakakis theorem
Context triple: [Christos H. Papadimitriou, knownFor, Papadimitriou–Yannakakis theorem]

• A. Papadimitriou: Computational Complexity
  "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
• B. 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.
• C. Babai–Fortnow–Lund–Safra–Szegedy theorem
  The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
• D. “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.
• E. Interactive Proofs and the Hardness of Approximating Cliques
  "Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
• 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: Papadimitriou–Yannakakis theorem
Triple: [Christos H. Papadimitriou, knownFor, Papadimitriou–Yannakakis theorem]

The Papadimitriou–Yannakakis theorem is a fundamental result in computational complexity theory that characterizes the complexity of certain optimization and approximation problems, particularly in relation to classes like NP and the theory of approximation algorithms.

Target entity: Papadimitriou–Yannakakis theorem
Target entity description: The Papadimitriou–Yannakakis theorem is a fundamental result in computational complexity theory that characterizes the complexity of certain optimization and approximation problems, particularly in relation to classes like NP and the theory of approximation algorithms.

• A. Papadimitriou: Computational Complexity
  "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
• B. 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.
• C. Babai–Fortnow–Lund–Safra–Szegedy theorem
  The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
• D. “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.
• E. Interactive Proofs and the Hardness of Approximating Cliques
  "Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
• F. None of above. chosen