NP stands for Nondeterministic Polynomial time in computational complexity theory. This class contains decision problems for which a proposed solution can be verified in polynomial time by a deterministic Turing machine, even though finding the solution might require exponential time.