Definition:NP-Complete

Definition
A problem "$L$" is NP-complete if any problem in the class NP can be reduced in polynomial time and space to $L$.