Contributions to Books:
E. De Panafieu, D. Gardy, B. Gittenberger, M. Kuba:
"Probabilities of 2-XOR functions";
in: "LATIN 2014: Theoretical Informatics",
A. Pardo, A. Viola (ed.);
Springer Verlag Berlin-Heidelberg,
Berlin-Heidelberg, Germany,
2014,
ISBN: 978-3-642-54422-4,
454
- 465.
English abstract:
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses x ⊕ y, is satisfiable. We consider here a refinement of this question, namely the probability that a random expression computes a specific Boolean function. The answer involves a description of 2-Xor expressions as multigraphs, and uses classical methods of analytic combinatorics.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-54423-1
Created from the Publication Database of the Vienna University of Technology.