Category:Cook-Levin theorem

From Wikimedia Commons, the free media repository
Jump to: navigation, search
English: In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete.

Media in category "Cook-Levin theorem"

The following 6 files are in this category, out of 6 total.