NP-hard

A problem $X$ is NP-hard if every problem in NP can be polynomially reduced to it.

$$Y{\le }_{p}X\text{ for all }Y\in \text{NP}$$