NP-Completeness

NP-Completeness refers to the computational complexity theory that problems can be categorized into how quick they are to solve and verify.

NP-Complete is short for nondeterministic polynomial-time complete.