NP-complete

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

This is an unmodified, but possibly outdated, definition from Wiktionary and used here under the Creative Commons license. Wiktionary is a great resource. If you like it too, please donate to Wikimedia.

This entry was last updated on RefTopia from its source on 3/20/2012.