Probabilities of 2-Xor Functions
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.
Keywordsmultigraphs probability of Boolean functions 2-Xor expressions
Unable to display preview. Download preview PDF.
- 7.Pittel, B., Yeum, J.A.: How frequently is a system of 2-linear equations solvable? Electronic Journal of Combinatorics 17 (2010)Google Scholar