This diagram is on Wikipedia:
On left side we see NP-hard intersecting NP class (assuming P!=NP), on right side we see NP-hard including NP (assuming P=NP)
Where should I place the following problems (assume decisional part)?
- Traveling salesman
- Subset sum problem
- Sorting a list (any problem known to be solvable and verifiable in Polinomial time)
- Hanoi Towers
I'm a bit confused because I've seen many versions of those diagrams (I'm not even sure those are correct right now).
