NP-Hard is a set of problems that cannot be solved in polynomial time and may or may not be verifiable in polynomial time. If an NP-Hard problem is solved, it can be used to solve every other NP problem.
Examples
- The Optimal TSP problem
- Obtaining the chromatic number of a graph i.e Optimisation Graph Colouring
- The Halting Problem (NP-Hard ONLY)