Difference between np and np complete?

Answer:
A problem is 'in NP' if there exists a polynomial time complexity algorithm which runs on a Non-Deterministic Turing Machine that solves it.

A problem is 'NP Hard' if all problems in NP can be reduced to it in polynomial time, or equivalently if there is a polynomial-time reduction of any other NP Hard problem to it.

A problem is NP Complete if it is both in NP and NP hard.
First answer by Tobyodavies. Last edit by Tobyodavies. Contributor trust: 0 [recommend contributor recommended]. Question popularity: 3 [recommend question].