Adjective
NP-complete (not comparable)
(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).
A likely example of problems solvable by NTMs but not by quantum computers in polynomial time are NP-complete problems. Source: Internet
An example of an NP-complete problem is the subset sum problem : given a finite set of integers, is there a non-empty subset that sums to zero? Source: Internet
A famous network of conditional proofs is the NP-complete class of complexity theory. Source: Internet
A key reason for this belief is that after decades of studying these problems no one has been able to find a polynomial-time algorithm for any of more than 3000 important known NP-complete problems (see List of NP-complete problems ). Source: Internet
An important unsolved problem in complexity theory is whether the graph isomorphism problem is in P, NP-complete, or NP-intermediate. Source: Internet
An important notion in this context is the set of NP-complete decision problems, which is a subset of NP and might be informally described as the "hardest" problems in NP. Source: Internet