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: The Design and Analysis of Computer Algorithms | Statement: [Alfred V. Aho, coAuthorOf, The Design and Analysis of Computer Algorithms]

Target entity: The Design and Analysis of Computer Algorithms
Context triple: [Alfred V. Aho, coAuthorOf, The Design and Analysis of Computer Algorithms]

• A. Introduction to Algorithms
  Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
• B. Algorithms + Data Structures = Programs
  "Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
• C. The Art of Computer Programming
  The Art of Computer Programming is Donald Knuth’s seminal multi-volume work that rigorously analyzes algorithms and data structures, widely regarded as one of the most influential and comprehensive texts in computer science.
• D. "Reducibility Among Combinatorial Problems" (1972)
  "Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
• 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: The Design and Analysis of Computer Algorithms
Triple: [Alfred V. Aho, coAuthorOf, The Design and Analysis of Computer Algorithms]

The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.

Target entity: The Design and Analysis of Computer Algorithms
Target entity description: The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.

• A. Introduction to Algorithms
  Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
• B. Algorithms + Data Structures = Programs
  "Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
• C. The Art of Computer Programming
  The Art of Computer Programming is Donald Knuth’s seminal multi-volume work that rigorously analyzes algorithms and data structures, widely regarded as one of the most influential and comprehensive texts in computer science.
• D. "Reducibility Among Combinatorial Problems" (1972)
  "Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
• 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