Generalized satisfiability problems: Minimal elements and phase transitions

Theoretical Computer Science

Volumn 302, Issue 1-3, 2003, Pages 417-430

  Creignou, Nadia ^a   Daudé, Hervé ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b CNRS   (France)

Author keywords

Minimal elements; Phase transition; Random structures; Satisfiability; Threshold phenomenon

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; PHASE TRANSITIONS; PROBABILITY;

RANDOM STRUCTURES;

SOFTWARE PROTOTYPING;

EID: 0038238506     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00890-3     Document Type: Article

References (20)

1. D. Achlioptas, A. Chtcherba, G. Istrate, C. Moore, The phase transition in NAE-k-SAT and 1-in-k-SAT, Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, SODA'2001, Washington D.C, USA, 2001, pp. 721-722.
2. Bollobás B. Random Graphs. 1985;Academic Press, New York.
3. Bollobás B., Borgs C., Chayes J.T., Han Kim J., Wilson D.B. The scaling window of the 2-SAT transition. Random Struct. Algorithms. 18(3):2001;201-256.
4. Chvátal V., Reed B. Mick gets some (the odds are on his side). Proc. 33rd Annu. Symp. on Foundations of Computer Science. 1992;620-627 IEEE, Pittsburgh, USA.
5. Creignou N., Daudé H. Satisfiability threshold for random XOR-CNF formulæ Discrete Appl. Math. 96-97(1-3):1999;41-53.
6. N. Creignou, H. Daudé, Coarse and sharp thresholds for random k -XOR-CNF satisfiability, Theoretical informatics and applications, to appear, 2003.
7. N. Creignou, H. Daudé, Random generalized satisfiability problems, Proc. Fifth Internat. Symp. on Theory and Applications of Satisfiability Testing, SAT'2002, Cincinatti, USA, 2002, pp. 17-26.
8. N. Creignou, H. Daudé, O. Dubois, Approximating the satisfiability threshold for random k -XOR-formulas, Combin. Proba. Comput., to appear 2002.
9. Creignou N., Khanna S., Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications. 2001;SIAM, Philadelphia, PA.
10. O. Dubois, Y. Boufkhad, J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, SODA'2000, San Francisco, CA, USA, 2000, pp. 124-126.
11. Dubois O., Monasson R., Selman B., Zecchina R. Editorial "Phase transitions in combinatorial problems" Theoret. Comput. Sci. 265(1-2):2001.
12. W. Fernandez de la Vega, On random 2-SAT, Unpublished manuscript, 1992.
13. E. Friedgut, and an appendix by J. Bourgain, Sharp thresholds of graph properties, and the k -sat problem, J. AMS 12 (4) (1999) 1017-1054.
14. Goerdt A. A threshold for unsatisfiability. J. Comput. System Sci. 53(3):1996;469-486.
15. A. Kaporis, L. Kirousis, E. Lalas, The probabilistic analysis of a greedy satisfiability algorithm. Proc. Fifth Internat. Symp. on Theory and Applications of Satisfiability Testing, SAT'2002, Cincinatti, USA, 2002, pp. 362-376.
16. Kirkpatrick S., Selman B. Critical behavior in the satisfiability of random Boolean expressions. Science. 264:1994;1297-1301.
17. M. Molloy, Models and thresholds for random constraint satisfaction problems, Proc. 34th Annu. ACM Symp. on Theory of Computing, STOC'2002, Montreal, Canada, 2002, pp. 209-217.
18. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. 10th STOC, San Diego, CA, USA, Association for Computing Machinery, New York, 1978, pp. 216-226.
19. Selman B., Mitchell D., Levesque H. Generating hard satisfiability problems. Artif. Intell. 81(1-2):1996;17-29.
20. Verhoeven Y. Random 2-SAT and unsatisfiability. Inform. Process. Lett. 72:1996;119-123.