Cook–Levin theorem
theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
Facts
5 properties- Instance of
- theorem
- Part of
- list of theorems[4]
- Named after
- Stephen Cook, Leonid Levin[2][3]
- Solved by
- Leonid Levin[5]
- Studied by
- computation complexity theory[6]
🏷️ Also known as
en Cook–Levin theorem
en Cook's theorem
ar مبرهنة كوك وليفين
de Satz von Cook
de Satz von Cook und Levin
el Θεώρημα Κουκ-Λέβιν
es teorema de Cook
es teorema de Cook-Levin
fa قضیه کوک لوین
fr théorème de Cook
fr théorème de Cook-Levin
he משפט קוק-לוין
id Teorema Cook
it teorema di Cook
it teorema di Cook-Levin
ja クックの定理
ja クック-レビンの定理
ja クック–レビンの定理
ko 쿡-레빈 정리
pl Twierdzenie Cooka
🔖 Identifiers · 3
- Dictionary of Algorithms and Data Structures ID
- cookstheorem
- Freebase ID
- /m/030tgp
- Microsoft Academic ID (discontinued)
- 206602144
🔗 Connections
Named after 2
Created notable works 1
Instance of 1
Maintained by WikiProject 1
Part of 1
Solved by 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Cook–Levin theorem is a theorem[1].