Topic summary
Complete problem
Extracted from the Wikipedia article Complete (complexity).
Generally, complexity classes that have a computable enumeration have known complete problems, whereas classes that lack a computable enumeration have none. For example, NP, co-NP, PLS, PPA all have known natural complete problems.