Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time.