NP-Complete

programming
NP-Complete

A problem $f$ is NP-complete if

P Np Np Complete Np Hard