NP-complete

Adjective

 * 1)  That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).

Related terms

 * / the set of NP-complete problems
 * / the set of NP-complete problems

Translations

 * Dutch: NP-volledig, NP-compleet
 * Finnish: NP-täydellinen
 * French: NP-complet
 * Georgian: NP-სრული
 * German:
 * Portuguese: NP-completo