Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 28-37

  Achlioptas, Dimitris ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN VARIABLES; EXPERIMENTAL EVIDENCE; EXTENDED ABSTRACTS; LOWER BOUNDS; SATISFIABILITY;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

BOOLEAN ALGEBRA; HEURISTIC METHODS; ITERATIVE METHODS; PROBABILITY DISTRIBUTIONS; RANDOM NUMBER GENERATION;

FRIEZE-SUEN THEORY; SATISFIABILITY HEURISTICS;

EID: 0033705075     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335309     Document Type: Conference Paper

References (38)

1. D. Achlioptas, L. M. Kirousis, E. Kranakis, and D. Krizanc. Rigorous results for random (2+p)-SAT. In Proceedings of RALCOM 97 (Santorini, Greece), pages 1-13, 1997. Submitted to Theoret. Comput. Sci.
2. P. Beame and T. Pitassi. Propositional proof complexity: past, present, and future. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (65):66-89, 1998.
3. B. Bollobás, C. Borgs, J. Chayes, J. H. Kim, and D. B. Wilson. The scaling window of the 2-SAT transition. Manuscript, 1999.
4. A. Z. Broder, A. M. Frieze, and E. Upfal. On the satisfiability and maximum satisfiability of random 3-CNF formulas. In 4th Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), pages 322-330. ACM, New York, 1993.
5. M.-T. Chao and J. Franco. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput., 15(4):1106-1118, 1986. (Pubitemid 17465858)
6. V. Chvátal and B. Reed. Mick gets some (the odds are on his side). In 33th Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992), pages 620-627. IEEE Comput. Soc. Press, Los Alamitos, CA, 1992.
7. V. Chvátal and E. Szemerédi. Many hard examples for resolution. J. Assoc. Comput. Mach., 35(4):759-768, 1988.
8. S. A. Cook. The complexity of theorem-proving procedures. In 3rd Annual ACM Symposium on Theory of Computing (Shaker Heights, OH, 1971), pages 151-158. ACM, New York, 1971.
9. S. A. Cook and D. G. Mitchell. Finding hard instances of the satisfiability problem: a survey. In Satisfiability problem: theory and applications (Piscataway, NJ, 1996), pages 1-17. Amer. Math. Soc., Providence, RI, 1997.
10. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. ACM, 5:394-397, 1962.
11. M. Davis and H. Putnam. A computing procedure for quantification theory. J. Assoc. Comput. Mach., 7:201-215, 1960.
12. O. Dubois and Y. Boufkhad. A general upper bound for the satisfiability threshold of random r-SAT formulae. J. Algorithms, 24(2):395-420, 1997. (Pubitemid 127451227)
13. O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000), pages 126-127. ACM, New York, 2000.
14. A. El Maftouhi and W. Fernandez de la Vega. On random 3-SAT. Combin. Probab. Comput., 4(3):189-195, 1995.
15. W. Fernandez de la Vega. On random 2-SAT. 1992. Manuscript.
16. J. Franco. Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Ann. Oper. Res., 1:273-289, 1984.
17. J. Franco and M. Paull. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Appl. Math., 5(1):77-87, 1983.
18. E. Friedgut. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc., 12:1017-1054, 1999.
19. A. M. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT. J. Algorithms, 20(2):312-355, 1996. (Pubitemid 126412188)
20. A. Goerdt. A threshold for unsatisfiability. J. Comput. System Sci., 53(3):469-486, 1996. (Pubitemid 126653479)
21. A. Goldberg. On the complexity of the satisfiability problem. In 4th Workshop on Automated Deduction (Austin, TX, 1979), pages 1-6, 1979.
22. A. Haken. The intractability of resolution. Theoret. Comput. Sci., 39(2-3):297-308, 1985.
23. S. Janson, Y. C. Stamatiou, and M. Vamvakari. Bounding the unsatisfiability threshold of random 3-SAT. 1999. Submitted.
24. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures Algorithms, 7(1):59-80, 1995.
25. R. Karp and M. Sipser. Maximum matchings in sparse random graphs. In 22nd Annual Symposium on Foundations of Computer Science, pages 364-375. IEEE Comput. Soc. Press, Los Alamitos, CA, 1981.
26. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou. Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms, 12(3):253-269, 1998. (Pubitemid 128444540)
27. T. G. Kurtz. Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probability, 7:49-58, 1970.
28. T. G. Kurtz. Approximation of population processes. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa., 1981.
29. A. W. Marshall and I. Olkin. Inequalities: theory of majorization and its applications. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1979.
30. R. Monasson and R. Zecchina. Entropy of the K-satisfiability problem. Phys. Rev. Leg., 76(21):3881-3885, 1996.
31. R. Monasson and R. Zecchina. Statistical mechanics of the random K-satisfiability model. Phys. Rev. E (3), 56(2):1357-1370, 1997.
32. R. Monasson and R. Zecchina. Tricritical points in random combinatorics: the (2 + p)-SAT case. J. Phys. A, 1998. submitted.
33. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Phase transition and search cost in the (2 + p)-SAT problem. In 4th Workshop on Physics and Computation, (Boston, MA, 1996).
34. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic phase transitions. Nature, 400:133-137, 1999. (Pubitemid 29327535)
35. N. Nedialkov. Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation. Ph.D. Thesis, University of Toronto, 1999.
36. D. Redfern. The Maple Handbook: Maple V Release 3. Springer Verlag, New York, third edition, 1994.
37. B. Selman, D. G. Mitchell, and H. J. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29, 1996. (Pubitemid 126349547)
38. N. C. Wormald. Differential equations for random processes and random graphs. Ann. Appl. Probab., 5(4):1217-1235, 1995.