NP-hardadj. designating an intractable problem (whether or not NP) which may be polynomially reduced to an NP-complete problem.
ΚΠ
1975 SIGACT News Jan. 26 Checking for Hamiltonian circuit in bipartite graphs is shown to be NP-hard.
1995 New Scientist 28 Oct. 42/1 If you do have an NP-hard problem to solve, there's no reason to throw in the towel—your problem may not be a worst-case instance at all.