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: Levin reduction | Statement: [Leonid Levin, notableFor, Levin reduction]

Target entity: Levin reduction
Context triple: [Leonid Levin, notableFor, Levin reduction]

• A. Turing reducibility
  Turing reducibility is a central computability-theoretic notion that compares the relative computational difficulty of decision problems by allowing one problem to be solved using an oracle for another.
• B. Karp reductions chosen
  Karp reductions are polynomial-time many-one reductions used in computational complexity theory to show that one decision problem is at least as hard as another, central to defining NP-completeness.
• C. 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.
• D. 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.
• E. Deuring reduction theorem
  The Deuring reduction theorem is a result in number theory that relates the reduction of elliptic curves with complex multiplication modulo primes to the theory of quaternion algebras and endomorphism rings.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.