Np-Hardness - What is NP-hard?

Answer

A problem is classified as NP-hard if a method for resolving it can be converted into one for addressing any NP issue (nondeterministic polynomial time issue). So, being NP-hard essentially means 'as hard as or potentially harder than any NP-problem'.