Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03511484n
Noun Named Entity
SYL
No term available
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
EN
theorem
NAMED AFTER
Stephen Cook
Leonid Levin
SOLVED BY
Leonid 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