garden/np-complete.md
2025-09-12 09:37:24 -06:00

4 lines
183 B
Markdown

# 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