Definition:NP-Complete
From ProofWiki
Definition
A problem "$L$" is NP-complete if any problem in the class NP can be reduced in polynomial time and space to $L$.
You can help Proof Wiki by expanding it.
To discuss it in more detail, feel free to use the talk page.
When this page/section has been completed, {{Stub}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
