Definition of NP-hard in US English:

NP-hard

adjective

Computing Mathematics
  • Designating an intractable problem (whether or not NP) which may be polynomially reduced to an NP-complete problem.

Origin

1970s; earliest use found in SIGACT News.