NP-Complete
programming
NP-Complete
A problem $f$ is
NP-complete
if
$f$ is
NP
, and
$f$ is
NP-hard
.