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: “Probabilistic computations: Toward a unified measure of complexity” | Statement: [Andrew Yao, notableWork, “Probabilistic computations: Toward a unified measure of complexity”]

Target entity: “Probabilistic computations: Toward a unified measure of complexity”
Context triple: [Andrew Yao, notableWork, “Probabilistic computations: Toward a unified measure of complexity”]

• 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. 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.
• C. 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.
• D. Kolmogorov complexity
  Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
• E. 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.
• 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: “Probabilistic computations: Toward a unified measure of complexity”
Triple: [Andrew Yao, notableWork, “Probabilistic computations: Toward a unified measure of complexity”]

“Probabilistic computations: Toward a unified measure of complexity” is a seminal research paper by Andrew Yao that laid foundational concepts in computational complexity theory, particularly regarding the role and analysis of randomness in algorithms.

Target entity: “Probabilistic computations: Toward a unified measure of complexity”
Target entity description: “Probabilistic computations: Toward a unified measure of complexity” is a seminal research paper by Andrew Yao that laid foundational concepts in computational complexity theory, particularly regarding the role and analysis of randomness in algorithms.

• 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. 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.
• C. 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.
• D. Kolmogorov complexity
  Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
• E. 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.
• F. None of above. chosen