NP-complete

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Adjective[edit]

Wikipedia has an article on:

Wikipedia

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[edit]

Translations[edit]