NP-completenessn. the condition of a problem of being NP-complete.
ΚΠ
1976 Computing16 263 (title) The NP-completeness of the bandwidth minimization problem.
1994 SIAM Rev.36 157 The notion of NP-completeness has helped researchers in several fields to argue that some problems are intrinsically difficult to solve computationally.