How frequently is a system of 2-linear Boolean equations solvable?

zbMath1193.05147arXiv1005.1951MaRDI QIDQ986694

Ji-A Yeum, Boris G. Pittel

Publication date: 12 August 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.1951

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic expansions of solutions to ordinary differential equations (34E05)

Related Items (6)

Exact enumeration of satisfiable 2-SAT formulae ⋮ The Satisfiability Threshold fork-XORSAT ⋮ 2-Xor revisited: satisfiability and probabilities of functions ⋮ Counting strongly-connected, moderately sparse directed graphs ⋮ Unnamed Item ⋮ Analytic description of the phase transition of inhomogeneous multigraphs

This page was built for publication: How frequently is a system of 2-linear Boolean equations solvable?