2-Xor revisited: satisfiability and probabilities of functions

Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger +1

The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses $x\oplus y$, is satisfiable. We revisit this classical problem by giving…