Reductions:

To prove that a problem B is NP-hard, reduce a known NP-hard problem (A) to B .

-Jeff Erickson, Algorithms