Abstract
The XOR-satisfiability (XORSAT) problem requires finding an assignment of
We prove a complete characterization of this clustering phase transition for random
Our proof constructs a very sparse basis for the set of solutions (or the subset within a cluster). This construction is intimately tied to the construction of specific subgraphs of the hypergraph associated with an instance of
Citation
Morteza Ibrahimi. Yash Kanoria. Matt Kraning. Andrea Montanari. "The set of solutions of random XORSAT formulae." Ann. Appl. Probab. 25 (5) 2743 - 2808, October 2015. https://doi.org/10.1214/14-AAP1060
Information