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.
Cook–Levin theorem 
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
Upload media
Wikipedia-logo-v2.svg  Wikipedia
Instance of theorem
Named after
Authority control
Blue pencil.svg
teorema de Cook (es); théorème de Cook (fr); Теорема Кука — Левина (ru); Satz von Cook (de); Teorema de Cook-Levin (pt); قضیه کوک لوین (fa); Cook-Levin理論 (zh); Кук-Левинова теорема (sr); Cook-Levin teoremi (tr); クックの定理 (ja); Teorema Cook (id); Twierdzenie Cooka (pl); משפט קוק-לוין (he); Cook-Levinov teorem (sh); teorema di Cook (it); Теорема Кука — Левіна (uk); Cook–Levin theorem (nl); 쿡-레빈 정리 (ko); Cook–Levin theorem (en); مبرهنة كوك وليفين (ar); Θεώρημα Κουκ-Λέβιν (el); teorema Cook–Levin (ro) Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist (en); mathematischer Satz (de) teorema de Cook-Levin (es); クック-レビンの定理 (ja); Satz von Cook und Levin (de); Cook's theorem (en); théorème de Cook-Levin (fr); 證明 (zh); Cookov teorem (sh)

Media in category "Cook-Levin theorem"

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