56 citations · 70 across the 4 of their papers we have counts for
4 papers
Phase Transition for Random Quantified XOR-Formulas
N. Creignou, H. Daude, U. Egly
The QXORSAT problem is the quantified version of the satisfiability problem XORSAT in which the connective exclusive-or is used instead of the usual or. We study the phase transiti…
The threshold for random (1,2)-QSAT
Nadia Creignou, Herve Daude, Uwe Egly +1
The QSAT problem is the quantified version of the SAT problem. We show the existence of a threshold effect for the phase transition associated with the satisfiability of random qua…
Pairs of SAT Assignment in Random Boolean Formulae
Hervé Daudé, Marc Mezard, Thierry Mora +1
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments dif…
Approximating the satisfiability threshold for random k-XOR-formulas
Nadia Creignou, Herve Daude, Olivier Dubois
In this paper we study random linear systems with variables per equation over the finite field GF(2), or equivalently -XOR-CNF formulas. In a previous paper Creignou and Dau…