Cook–Levin theorem
Sign in to saveAlso known as Cook's theorem
theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
Also known as Cook's theorem
theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist