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: Yao’s minimax principle | Statement: [Andrew Yao, knownFor, Yao’s minimax principle]

Target entity: Yao’s minimax principle
Context triple: [Andrew Yao, knownFor, Yao’s minimax principle]

• A. Probably Approximately Correct learning (PAC learning)
  Probably Approximately Correct (PAC) learning is a foundational framework in computational learning theory that formalizes what it means for an algorithm to efficiently learn a concept from examples with high probability and small error.
• B. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• C. 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.
• D. Papadimitriou: Computational Complexity
  "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
• E. Gale’s theorem on linear inequalities
  Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
• 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: Yao’s minimax principle
Triple: [Andrew Yao, knownFor, Yao’s minimax principle]

Yao’s minimax principle is a fundamental result in computational complexity and randomized algorithms that relates the performance of randomized algorithms to the performance of deterministic algorithms against a worst-case input distribution.

Target entity: Yao’s minimax principle
Target entity description: Yao’s minimax principle is a fundamental result in computational complexity and randomized algorithms that relates the performance of randomized algorithms to the performance of deterministic algorithms against a worst-case input distribution.

• A. Probably Approximately Correct learning (PAC learning)
  Probably Approximately Correct (PAC) learning is a foundational framework in computational learning theory that formalizes what it means for an algorithm to efficiently learn a concept from examples with high probability and small error.
• B. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• C. 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.
• D. Papadimitriou: Computational Complexity
  "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
• E. Gale’s theorem on linear inequalities
  Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
• F. None of above. chosen