computation Definition NP-complete Problem A problem is NP-complete if it is in the NP and is NP-hard.