Cook–Levin theorem (Q6481822)

From MaRDI portal





Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
  • Cook's theorem
Language Label Description Also known as
English
Cook–Levin theorem
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
  • Cook's theorem

Statements

Identifiers