Q377276

From Wikidata
Jump to: navigation, search

Cook–Levin theorem (Q377276) [edit]

Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist [edit]

Also known as:
  • Cook's theorem

Statements

[edit]
0 references
[add]
/m/030tgp
[edit]
1 reference
[add]
[edit]
0 references
[edit]
0 references
[add]
Language Code Linked page
العربية arwiki
Deutsch dewiki
English enwiki
español eswiki
فارسی fawiki
français frwiki
עברית hewiki
Bahasa Indonesia idwiki
italiano itwiki
한국어 kowiki
polski plwiki
português ptwiki
русский ruwiki
srpskohrvatski / српскохрватски shwiki
Simple English simplewiki
српски / srpski srwiki
Türkçe trwiki
українська ukwiki
中文 zhwiki
[add]
[add]
[add]
[add]
[add]
[add]