\begin{definition}[Definition:NP-Complete]
A problem $L$ is '''NP-complete''' if any problem in the complexity class NP can be reduced in polynomial time and space to $L$.
{{NoSources}}
Category:Definitions/Mathematical Logic
Category:Definitions/Computer Science
\end{definition}