# NP Complete

- a problem that all other [[np]] problems can be reduced to
- if you can solve the decision version in P-time, you can solve all decision problems in [[np]] in P-time