Phase Transition for Random Quantified XOR-Formulas

@article{Creignou2007PhaseTF,
  title={Phase Transition for Random Quantified XOR-Formulas},
  author={Nadia Creignou and Herv{\'e} Daud{\'e} and Uwe Egly},
  journal={J. Artif. Intell. Res.},
  year={2007},
  volume={29},
  pages={1-18}
}
The QXOR-SAT problem is the quantified version of the satisfiability problem XOR-SAT in which the connective exclusive-or is used instead of the usual or. We study the phase transition associated with random QXOR-SAT instances. We give a description of this phase transition in the case of one alternation of quantifiers, thus performing an advanced practical and theoretical study on the phase transition of a quantified problem. 

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Complexity classifications of Boolean constraint satisfaction problems

  • N. Creignou, S. Khanna, M. Sudan
  • SIAM Monographs On Discrete Mathematics And…
  • 2001

On the limit distribution of the number of cycles in a random graph

  • L. Takács
  • Journal of Applied Probability,
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…