# Definition:NP-Complete

## Definition

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

From ProofWiki

Jump to: navigation, search

You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links.

*To discuss this in more detail, feel free to use the talk page.*

*Once you have done so, you can remove this instance of* `{{MissingLinks}}` *from the code.*

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

- This page was last modified on 4 December 2015, at 04:02 and is 0 bytes
- Content is available under Creative Commons Attribution-ShareAlike License unless otherwise noted.