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: Cook–Levin theorem | Statement: [Reducibility Among Combinatorial Problems, basedOn, Cook–Levin theorem]

Target entity: Cook–Levin theorem
Context triple: [Reducibility Among Combinatorial Problems, basedOn, Cook–Levin theorem]

• A. Cook–Levin theorem chosen
  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.
• B. Hartmanis–Stearns theorem
  The Hartmanis–Stearns theorem is a foundational result in computational complexity theory that formally established time complexity as a central measure of computational resources for Turing machines.
• C. 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.
• D. Valiant–Vazirani theorem
  The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
• E. PCP theorem
  The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.