English

Adjective

NP-complete ‎(not comparable)

1. (computing theory) Describing the hardest problems that are in the class NP, and whose solutions can be verified in polynomial time.

Related terms

• NP-hard
• NP-easy
• NP-equivalent

Translations