Definitions from Wiktionary (Cook-Levin theorem)

▸ noun:  (computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete.


▸ Words similar to cook-levin theorem
▸ Usage examples for cook-levin theorem

▸ Idioms related to cook-levin theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near cook-levin theorem
▸ Rhymes of cook-levin theorem

▸ Invented words related to cook-levin theorem