Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Np-Hardness - What is NP-hard?


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'.