Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03278571n
Noun Concept
Categories: NL-complete problems, Satisfiability problems
EN
2-satisfiability  2-CNF-SAT  2-SAT  2SAT  Krom-clause
EN
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. Wikipedia
Definitions
Relations
Sources
EN
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. Wikipedia
theoretical computer science problem Wikidata
IS A
computational problem
Boolean satisfiability problem
Wikipedia
EN
2-satisfiability
Wikidata
EN
2-satisfiability
Wikipedia Redirections
EN
2-CNF-SAT, 2-SAT, 2SAT, Krom-clause, Krom formula, Krom formulae, MAX-2-SAT, MAX-2SAT, MAX 2-SAT, maximum 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