The complexity class NP is the class of languages that can be verified by a polynomial-time algorithm.

L NP if algorithm A verifies language L in polynomial time.

Example: HAM-CYCLE NP