🇬🇧 en de 🇩🇪

NP-complete adjective

  • (computing theory, of a, decision problem) 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).
 NP-vollständig
Wiktionary Links