NP-completeness
E173625
UNEXPLORED
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.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| Cook–Levin theorem | 1 |
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Cook–Levin theorem