What is NP-complete?
A problem is named NP-complete that it is both a NP-hard and NP problem.
How do we prove that a problem is NP-complete?
First, prove it is a NP problem, then u need to find another NP-complete
problem
reducing to it.
How do you rank NP, NP-complete, NP-hard?
NP < NP-complete < NP-hard
"Faw" <fa*****@gmail.com>
???????:11**********************@f14g2000cwb.googl egroups.com...
What is NP-complete?
How do we prove that a problem is NP-complete?
How do you rank NP, NP-complete, NP-hard?