Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03511484n
Noun Named Entity
JA
クックの定理  クック-レビンの定理  クック–レビンの定理  クッlevinの定理
EN
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. Wikipedia
Relations
Sources
IS A
定理
NAMED AFTER
スティーブン・クック
Leonid Levin
SOLVED BY
Leonid Levin
Wikidata
JA
クックの定理
Wikidata Alias
JA
クック-レビンの定理, クック–レビンの定理
Wikipedia Translations
JA
クッlevinの定理

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License