Satisfiability threshold for random XOR-CNF formulas

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 41-53

  Creignou, Nadia ^a,c   Daude, Hervé ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

^c AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Randomly generated formulas; Satisfiability; Threshold phenomenon

Indexed keywords

EID: 0002424157     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00032-3     Document Type: Article

References (18)

1. B. Aspvall, M.F. Plass, R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Inform. Processing Lett. 8 (3) (1979) 121-123.
2. B. Bollobâs, Random Graphs, Academic Press, New York 1985.
3. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 620-627.
4. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
5. S.A. Cook, The complexity of theorem-proving procedures, in: Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
6. J.M. Crawford, D. Auton, Experimental results on the crossover point in satisfiability problems, in: Proceedings of the 11th National Conference on Artificial Intelligence, 1993, pp. 21-27.
7. N. Creignou, M. Hermann, Complexity of generalized satisfiability counting problems, Inform. Comput. 125 (1) (1996) 1-12.
8. P. Erdös, A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 7 (1960) 17-61.
9. S.D. Fisher, M.N. Alexander, Matrices over a finite field, Amer. Math. Mon. 73 (1966) 639-641.
10. A. Frieze, S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J. Algorithms 20 (2) (1996) 312-355.
11. I.P. Gent, T. Walsh, The SAT phase transition, in: Proceedings of the 11th European Conference on Artificial Intelligence, 1994, pp. 105-109.
12. A. Goerdt, A threshold for unsatisfiability, in: L. Havel, V. Koubek (Eds.), Mathematical Foundations of Computer Science, Springer, Berlin, 1992, pp. 264-274.
13. A. Kamatah, R. Motwani, K. Palem, P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 1994, pp. 592-603.
14. I.N. Kovalenko, On the limit distribution of the number of solutions of a random system of linear equations in the class of boolean functions, Theory Probab. Appl. 12 (1) (1967) 47-56.
15. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the 10th National Conference on Artificial Intelligence, 1992, pp. 459-465.
16. A. Rényi, Calcul des Probabilités, Dunod, Paris, 1966.
17. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings 10th STOC, San Diego (CA, USA), Association for Computing Machinery, 1978, pp. 216-226.
18. J.-C. Simon, J. Carlier, O. Dubois, O. Moulines, Etude statistique de l'existence de solutions de problèmes SAT, et application aux systèmes-experts, Compte Rendus de l'Académie des Sciences de Paris, tome 302, Sér. I 7 (1986) 283-286.