Jump to navigation Jump to 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.
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
Media in category "Cook-Levin theorem"
The following 7 files are in this category, out of 7 total.