Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03241303n
Noun Concept
SYL
No term available
EN
In logic and computer science, the Boolean satisfiability problem is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. Wikipedia
Relations
Sources
IS A
EN
NP-complete
EN
satisfiability
EN
decision problem
PART OF
EN
Karp's 21 NP-complete problems
HAS KIND
EN
2-satisfiability

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