NP-complete

adj

Meaning

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).

Sources

No citations have been attached yet.