A problem is NP-Hard if an algorithm for solving it can be translated into one for solving any np-problem, it therefore means “at least as hard as any np-problem” although it might be harder.
Search
A problem is NP-Hard if an algorithm for solving it can be translated into one for solving any np-problem, it therefore means “at least as hard as any np-problem” although it might be harder.