2SAT

(redirected from 2-satisfiability)
Also found in: Wikipedia.
AcronymDefinition
2SAT2-Satisfiability (Boolean satisfiability problem expressed in 2CNF form)
References in periodicals archive ?
The problem of 2-satisfiability presents a striking analogy with the random graph process.
The problem CSP([[Lambda].sup.[disjunction]2]) corresponds to the 2-SATISFIABILITY problem, which is well-known to be tractable [Garey and Johnson 1979].
With these definitions, CSP([Gamma] [union] [Delta]) is equivalent to the standard 2-SATISFIABILITY problem, and hence [CSP.sub.[Delta][is less than or equal to] 2] ([Gamma] [union] [Delta]) is tractable.
In 1992, Berman and Schnitger renewed the interest of the scientific community about the approximability of IS, by proving that for some positive constant c it is not possible to approximate IS within a factor of [n.sup.c], provided maximum 2-satisfiability does not admit a randomized polynomial time approximation schema.