NP-complete problem

NP-complete problem

[¦en¦pē kəm′plēt ‚präb·ləm] (computer science) One of the hardest problems in class NP, such that, if there are any problems in class NP but not in class P, this is one of them.