NP
NP stands for nondeterministic polynomial time.
We consider the class of decision problems (yes/no problems).
A nondeterministic algorithm is one that can make “guesses”.
A decision problem is in NP if it can be solved by a nondeterministic algorithm that runs in polynomial time.