Definitions from Wikipedia (Karp's 21 NP-complete problems)

▸ noun:  In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.


▸ Words similar to Karp's 21 NP-complete problems
▸ Usage examples for Karp's 21 NP-complete problems

▸ Idioms related to Karp's 21 NP-complete problems
▸ Wikipedia articles (New!)
▸ Words that often appear near Karp's 21 NP-complete problems
▸ Rhymes of Karp's 21 NP-complete problems

▸ Invented words related to Karp's 21 NP-complete problems