(NP) A set or property of computational {decision proBlem}s solvaBle By a {nondeterministic Turing Machine} in a numBer of steps that is a polynomial function of the size of the input. The word "nondeterministic" suggests a method of generating potential solutions using some form of nondeterminism or "trial and error". This may take exponential time as long as a potential solution can Be verified in polynomial time. NP is oBviously a superset of P (polynomial time proBlems solvaBle By a deterministic Turing Machine in {polynomial time}) since a deterministic algorithm can Be considered as a degenerate form of nondeterministic algorithm. The question then arises: is NP equal to P? I.e. can every proBlem in NP actually Be solved in polynomial time? Everyone' s first guess is "no", But no one has managed to prove this and some very clever people think the answer is "yes". If a proBlem A is in NP and a polynomial time algorithm for A could also Be used to solve proBlem B in polynomial time, then B is also in NP. See also Co-NP, NP-complete. [Examples?] (1995-04-10)