From the Definition section
>A decision problem H is NP-hard when for every problem L in NP, there is a polynomial-time many-one reduction from L to H
>A decision problem H is NP-hard when for every problem L in NP, there is a polynomial-time many-one reduction from L to H