NP (Non-Deterministic Polynomial Time)
- a type of complexity class that is the set of all decision problems where correct answers can be VERIFIED in polynomial time by a deterministic Turing machine
- or alternatively the set of problems that can be solved in polynomial time by a nondeterministic Turing machine