P, NP, NP-complete problem Figure 1: NP problem P A set of problems that can be solved by a deterministic Turing machine in polynomial-time. NP The NP problems is a set of decision problems that can be solved by a Non-deterministic Turing Machine in polynomial-time, P is a subset of NP(any problem that can be solved by a deterministic machine in polynomial time can also be solved by a non-deterministic machine in polynomial time)

Document Title