Category:Cook-Levin theorem

From Wikimedia Commons, the free media repository
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.
<nowiki>teorema de Cook; théorème de Cook; teorema de Cook-Levin; Satz von Cook; Teorema de Cook-Levin; قضیه کوک لوین; Cook-Levin理論; Кук-Левинова теорема; Cook-Levin teoremi; クックの定理; teorema di Cook; Teorema Cook; Twierdzenie Cooka; משפט קוק-לוין; Cook-Levinov teorem; teorema Cook–Levin; Теорема Кука — Левіна; Cook–Levin theorem; 쿡-레빈 정리; Cook–Levin theorem; مبرهنة كوك وليفين; Θεώρημα Κουκ-Λέβιν; Теорема Кука — Левина; teorema che afferma che il problema di soddisfacibilità booleana è NP-completo; Théorème en informatique théorique; mathematischer Satz; Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist; teorema de Cook-Levin; クック-レビンの定理; クック–レビンの定理; Satz von Cook und Levin; Cook's theorem; théorème de Cook-Levin; 證明; Cookov teorem</nowiki>
Cook–Levin theorem 
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
Upload media
Instance of
Named after
Authority file
Edit infobox data on Wikidata

Media in category "Cook-Levin theorem"

The following 6 files are in this category, out of 6 total.