bn:03241303n
Noun Concept
Categories: Electronic design automation, Satisfiability problems, Logic in computer science, Boolean algebra, NP-complete problems
EN
Boolean satisfiability problem  SAT  1-in-3-SAT  3-SAT  3-satisfiability
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
Definitions
Relations
Sources