Category:Cook-Levin theorem
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 | |||||
Upload media | |||||
Instance of | |||||
---|---|---|---|---|---|
Part of |
| ||||
Named after | |||||
| |||||
Media in category "Cook-Levin theorem"
The following 6 files are in this category, out of 6 total.
-
CookLevin svg.svg 1,035 × 514; 52 KB
-
CookLevin.pdf 1,722 × 856; 21 KB
-
CookLevinCommDiag svg.svg 354 × 142; 38 KB
-
CookLevinCommDiag.pdf 589 × 235; 35 KB
-
Sat tablo.png 453 × 337; 4 KB
-
Tablo sat.jpg 638 × 464; 58 KB