NP-complete (English, adj)
expansion: NP-complete (not comparable)
Senses:
topics: computing
computing-theory
engineering
mathematics
natural-sciences
physical-sciences
sciences
glosses: 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).
tags: not-comparable
raw_tags: of a decision problem
Forms: