Optimal myopic algorithms for random 3-SAT

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 590-600

  Achlioptas, Dimitris ^a   Sorkin, Gregory B ^b  

^a MICROSOFT RESEARCH   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIFFERENTIAL EQUATIONS; OPTIMIZATION; THEOREM PROVING;

OPTIMAL MYOPIC ALGORITHMS;

RANDOM PROCESSES;

EID: 0034499891     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892327     Document Type: Article

References (22)

1. D. Achlioptas A survey of lower bounds for random 3-SAT via differential equations Theoret. Comput. Sci. www.research.microsoft.com/~optas/lbsurvey.ps
2. D. Achlioptas Setting two variables at a time yields a new lower bound for random 3-SAT 32nd Annual ACM Symposium on Theory of Computing 28 37 32nd Annual ACM Symposium on Theory of Computing Portland OR 2000
3. D. Achlioptas L. M. Kirousis E. Kranakis D. Krizanc Rigorous results for random (2+p)-SAT Theoret. Comput. Sci.
4. A. Z. Broder A. M. Frieze E. Upfal On the satisfiability and maximum satisfiability of random 3-CNF formulas 4th Annual ACM-SIAM Symp. on Disc. Alg. 322 330 4th Annual ACM-SIAM Symp. on Disc. Alg. Austin TX 1993
5. M.-T. Chao J. Franco Probabilistic analysis of two heuristics for the 3-satisfiability problem SIAM J. Comput. 15 4 1106 1118 1986
6. V. Chvátal B. Reed Mick gets some (the odds are on his side) 33th Annual Symposium on Foundations of Computer Science 620 627 33th Annual Symposium on Foundations of Computer Science Pittsburgh PA 1992
7. O. Dubois Y. Boufkhad J. Mandler Typical random 3-SAT formulae and the satisfiability threshold 11th Annual ACM-SIAM Symp. on Disc. Alg. 126 127 11th Annual ACM-SIAM Symp. on Disc. Alg. San Francisco CA 2000
8. 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
9. A. M. Frieze S. Suen Analysis of two simple heuristics on a random instance of k-SAT J. Algorithms 20 2 312 355 1996
10. M. R. Garey D. S. Johnson Computers and Intractability 1979 Freeman CA, San Francisco
11. A. Goerdt A threshold for unsatisfiability J. Comput. System Sci. 53 3 469 486 1996
12. R. L. Graham An efficient algorithm for determining the convex hull of a finite planar set Information Processing Letters 1 132 133 1972
13. S. Janson Y. C. Stamatiou M. Vamvakari Bounding the unsatisfiability threshold of random 3-SAT Random Structures Algorithms 17 2 103 116 2000
14. T. G. Kurtz Solutions of ordinary differential equations as limits of pure jump Markov processes J. Appl. Probability 7 49 58 1970
15. R. Monasson R. Zecchina Entropy of the K-satisfiability problem Phys. Rev. Lett. 76 21 3881 3885 1996
16. R. Monasson R. Zecchina Statistical mechanics of the random K-satisfiability model Phys. Rev. E (3) 56 2 1357 1370 1997
17. R. Monasson R. Zecchina Tricritical points in random combinatorics: the (2 + p)-SAT case J. Phys. A: Math, and Gen. 31 46 9209 9217 1998
18. J. Palis W. de Melo Geometric Theory of Dynamical Systems 1980 Springer-Verlag New York
19. L. Trevisan G. B. Sorkin M. Sudan D. P. Williamson Gadgets, approximation, and linear programming SIAM J. Comput. 29 6 2074 2097 Dec. 2000
20. N. C. Wormald Differential equations for random processes and random graphs Ann. Appl. Probab. 5 4 1217 1235 1995