Formal definition and related complexity classes

A decision problem is NP-complete if:
# is in NP, and
# Every problem in NP is reducible to in polynomial time.

can be shown to be in NP by demonstrating that a candidate solution to can be verified in polynomial time.

A decision problem that is solvable