A new upper bound for 3-SAT

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 2, Issue , 2008, Pages 163-174

  Diaz J ^a   Kirousis, L ^b,c   Mitsche, D ^a   Perez Gimenez X ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b University of Patras and Computer Technology Institute   (Greece)

^c UNIVERSITY OF PATRAS   (Greece)

Author keywords

3 SAT; Random; Satisfiability; Threshold

Indexed keywords

3-SAT; PROBABILISTIC TECHNIQUE; RANDOM; SATISFIABILITY; THRESHOLD; UPPER BOUND;

SOFTWARE ENGINEERING;

EID: 84880239573     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. D. Achlioptas and F. Ricci-Tersenghi. On the solution-space geometry of random constraint satisfaction problems. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 130-139, 2006.
2. D. Coppersmith, D. Gamarnik, M. T. Hajiaghayi, and G. Sorkin. Random Max SAT, Random Max Cut, and their phase transitions. Random Structures and Algorithms, 24: 502-545, 2004.
3. O. Dubois. Upper bound on the satisfiability threshold. Theoretical Computer Science, 265: 187-197, 2001.
4. O. Dubois and Y. Boufkhad. A general upper bound for the satisfiability threshold of random r-SAT formulae. Journal of Algorithms, 24: 395-420, 1997.
5. O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In Proceedings of the 11th Symposium on Discrete Algorithms (SODA), pages 126-127, 2000.
6. J. Franco and M. Paull. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5: 77-87, 1983.
7. E. Friedgut and J. Bourgain. Sharp thresholds of graph properties, and the k-SAT problem. Journal of the American Mathematical Society, 12: 1017-1054, 1999.
8. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms, 7: 59-80, 1995.
9. A. C. Kaporis, L. M. Kirousis, and E. G. Lalas. The probabilistic analysis of a greedy satisfiability algorithm. Random Structures and Algorithms, 28: 444-480, 2006.
10. S. Kirkpatrick and B. Selman. Critical behavior in the satisfiability of random Boolean expressions. Science, 264(5163): 1297-1301, 1994.
11. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. C. Stamatiou. Approximating the unsat-isfiability threshold of random formulas. Random Structures and Algorithms, 12: 253-269, 1998.
12. L. M. Kirousis, Y. C. Stamatiou, and M. Zito. The satisfiability threshold conjecture: Techniques behind upper bound. In A. P. G. Istrate and C. Moore, editors, Computational Complexity and Statistical Physics. Oxford University Press, 2005.
13. E. Maneva and A. Sinclair. On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theoretical Computer Science, 2008.
14. M. Mézard and R. Zecchina. Random k-satisfiability: from an analytic solution to a new efficient algorithm. Physics Review, E-66, 056126: 1357-1361, 2002.
15. R. Monasson and R. Zecchina. Statistical mechanics of the random k-SAT problem. Physics Review, E-56: 1357-1361, 1997.
16. N. C. Wormald. The differential equation method for random graph processes and greedy algorithms. In M. Karoński and H. J. Prömel, editors, Lectures on approximation and randomized algorithms, pages 73-155. PWN, Warsaw, 1999.