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: Computational Complexity: A Conceptual Perspective | Statement: [Oded Goldreich, authorOf, Computational Complexity: A Conceptual Perspective]

Target entity: Computational Complexity: A Conceptual Perspective
Context triple: [Oded Goldreich, authorOf, Computational Complexity: A Conceptual Perspective]

• A. Blum complexity measures
  Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
• B. Randomness and Computation
  "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
• C. Introduction to the Theory of Computation
  Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
• D. The Knowledge Complexity of Interactive Proof Systems
  "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
• 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. 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: Computational Complexity: A Conceptual Perspective
Triple: [Oded Goldreich, authorOf, Computational Complexity: A Conceptual Perspective]

Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.

Target entity: Computational Complexity: A Conceptual Perspective
Target entity description: Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.

• A. Blum complexity measures
  Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
• B. Randomness and Computation
  "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
• C. Introduction to the Theory of Computation
  Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
• D. The Knowledge Complexity of Interactive Proof Systems
  "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
• 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. chosen