In computational complexity, NP is the complexity class consisting of problems whose yes instances can be verified in polynomial time.  NP stands for 'nondeterministic polynomial time '.