A computational problem is NP Hard if for every problem that can be solved in Non-deterministic Polynomial Time, there is a polynomial time reduction from problem L, to H. AKA, every other problem in NP can be reduced to them in polynomial time.
For Example
An efficient solution to graph colouring would also be an efficient solution to SAT, TSP, etc.