Please enable JavaScript.
Coggle requires JavaScript to display documents.
P, NP and NP-complete - Coggle Diagram
P, NP and NP-complete
-
-
NP-Complete
- every problem in NP is polynomially reducible to D
Showing NP-Complete
First, one needs to show that the problem in question is in NP
The second step is to show that every problem in NP is reducible to the problem in question in polynomial time
-
-