bn:03278571n
Noun Concept
EL
2-ικανοποιησιμότητα
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
Relations
Sources