Q377276

From Wikidata
Jump to: navigation, search

Cook–Levin theorem (Q377276)[edit]

Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist [edit]

Also known as:
  • Cook's theorem
[edit]

Statements

[edit]
0 references
[add]
/m/030tgp
[edit]
1 reference
[add]
[edit]
0 references
[add]