As we will see, some problems are at least as hard to solve as any problem in NP. We call such problems NP hard.
How might we argue that problem X is at least as hard (to within a polynomial factor) as problem Y?
If X is at least as hard as Y, how would we expect an algorithm that is able to solve X to behave?
