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: co-NP | Statement: [NP-hardness, relatedClass, co-NP]

Target entity: co-NP
Context triple: [NP-hardness, relatedClass, co-NP]

• A. NP-completeness
  NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
• B. NP
  NP was the reporting mark used by the historic Northern Pacific Railway, a major transcontinental railroad in the northern United States.
• C. NP
  NP is the abbreviation commonly used for the National Party, the former ruling political party of apartheid-era South Africa.
• D. NP
  NP (nondeterministic polynomial time) is the complexity class of decision problems for which proposed solutions can be verified in polynomial time by a deterministic Turing machine.
• E. NP
  NP is a UK postcode area covering parts of Newport and surrounding regions in south-east Wales.
• 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: co-NP
Triple: [NP-hardness, relatedClass, co-NP]

co-NP is the complexity class containing decision problems whose complements are in NP, typically characterized by efficiently verifiable proofs of "no" instances.

Target entity: co-NP
Target entity description: co-NP is the complexity class containing decision problems whose complements are in NP, typically characterized by efficiently verifiable proofs of "no" instances.

• A. NP-completeness
  NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
• B. NP
  NP was the reporting mark used by the historic Northern Pacific Railway, a major transcontinental railroad in the northern United States.
• C. NP
  NP is the abbreviation commonly used for the National Party, the former ruling political party of apartheid-era South Africa.
• D. NP
  NP is a UK postcode area covering parts of Newport and surrounding regions in south-east Wales.
• E. NP
  NP (nondeterministic polynomial time) is the complexity class of decision problems for which proposed solutions can be verified in polynomial time by a deterministic Turing machine.
• F. None of above. chosen