NP-hard problems are NP-complete and harder problems. More precisely, a decision problem $H$ is NP-hard if there is another problem $H'$ that is NP-complete that can be reduced in polynomial time to $H$, i.e. solving $H$ leads to a solution for $H'$.