Name
NP-completeness
Description
The theory of computational complexity, focusing on problems that are at least as difficult as the hardest problems known to be solvable in non-deterministic polynomial time.
Types
Computer science
