Definition of NP-completeness in English:

NP-completeness

noun

Computing Mathematics
  • The condition of a problem of being NP-complete.

Origin

1970s; earliest use found in Computing.