co-NP
E1452088
UNEXPLORED
co-NP is the complexity class containing decision problems whose complements are in NP, typically characterized by efficiently verifiable proofs of "no" instances.
All labels observed (1)
| Label | Occurrences |
|---|---|
| co-NP canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T20836455 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
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
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.