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: P versus NP problem | Statement: [Avi Wigderson, hasResearchInterest, P versus NP problem]

Target entity: P versus NP problem
Context triple: [Avi Wigderson, hasResearchInterest, P versus NP problem]

• A. Millennium Prize Problem
  The Millennium Prize Problem is one of seven famous unsolved mathematical problems designated by the Clay Mathematics Institute, each carrying a $1 million reward for a correct solution.
• 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. Entscheidungsproblem
  The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
• D. 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.
• E. “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.
• 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: P versus NP problem
Triple: [Avi Wigderson, hasResearchInterest, P versus NP problem]

The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.

Target entity: P versus NP problem
Target entity description: The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.

• A. Millennium Prize Problem
  The Millennium Prize Problem is one of seven famous unsolved mathematical problems designated by the Clay Mathematics Institute, each carrying a $1 million reward for a correct solution.
• 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. Entscheidungsproblem
  The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
• D. 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.
• E. “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.
• F. None of above. chosen