NP hard
A problem is classified as NP-hard if it is at least as hard as the hardest problems in the complexity class NP.
Informally, the problem is as difficult as the hardest problems for which a solution can be verified in polynomial time.
A problem is classified as NP-hard if it is at least as hard as the hardest problems in the complexity class NP.
Informally, the problem is as difficult as the hardest problems for which a solution can be verified in polynomial time.