Nondeterministic Polynomial-Time (class NP)

The problem could be said to be in NP if it can be solved by a nondeterministic machine in polynomial time. To check this, one can simply ask whether all solved instances are correct and that the solution is correct.