B*********h
发帖数: 800 | 1 ☆─────────────────────────────────────☆
mbasamlewis (mbasamlewis) 于 (Thu Mar 8 02:19:59 2007) 提到:
I encounter some problems: what is the relation among NP, NP-complete, P,
and NP hard
I know:
1. P <= NP //<= is for belongs to
2. if(K <= NP && NP-hard)
k <= NP-C
Question:
3. what about NP hard Vs NP
....... NP hard Vs NP-complete
4. Is this right: P <= NP-hard
Thank you
☆─────────────────────────────────────☆
mbasamlewis (mbasamlewis) 于 (Thu Mar 8 02:30:17 2007) 提到:
to rob |
|
