Linear upper bounds for random walk on small density random 3-CNFs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 352-361

  Alekhnovich, Mikhail ^a   Ben Sasson, Eli ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; LINEAR PROGRAMMING; RANDOM PROCESSES;

MULTIPLICATIVE FACTOR; RANDOM WALK;

COMPUTER SCIENCE;

EID: 0344118874     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. D. Achlioptas. Setting two variables at a time yields a new lower bound for random 3-SAT. In Proc. 32nd STOC, pp 28-37 (2000).
2. D. Achlioptas. Lower Bounds for random 3-SAT via Differential Equations. In Theoretical Computer Science 285(1-2) (2001) 159-185.
3. D. Achlioptas and G. B. Sorkin. Optimal myopic algorithms for random 3-SAT In IEEE Symposium on Foundations of Computer Science pp. 590-600 (2000).
4. D. Achlioptas, P. Beame, M. Molly. A Sharp Threshold in Proof Complexity. In Proc. STOC 2001, pp. 337-346.
5. S. Baumer, R. Schuler. Improving a probabilistic 3-SAT algorithm by Dynamic Search and Independent Clause Pairs. ECCC report No. 10, 2003. Also presented at SAT 2003.
6. E. Ben-Sasson. Size Space Tradeoffs for Resolution. In STOC 2002.
7. M.T. Chao, J. Franco. Probabilistic Analysis of two heuristics for the 3-Satisfiability problem. In Infor. Sci. 51 (1990). 280-314.
8. V. Chvátal, B. Reed. Mick Gets Some (the odds are on his side). In FOCS'92 pp 620-627.
9. V. Chvátal, E. Szemerédi. Many Hard Examples for Resolution. In Journal of the Association for Computing Machinery. vol. 35 (1988), pp. 759-768.
10. E. Danstin, A. Goerdt, E. A. Hirsch, J. Kleinberg, C. Papadimitriou, P. Raghavan, U. Schoning. A Deterministic 2 - 2/k+1 algorithm for k-SAT based on local search. In Theoretical Computer Science, 223 (1-2): 1-72, 1999.
11. O. Dubois, Y. Boufkhad, J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In Proc. 11th SODA, pp. 126-127 (2000). Available at ftp://ftp.eccc.unitrier.de/pub/eccc/reports/2003/TR03-007/index.html
12. A. Broder, A. Frieze, E. Upfal. On the satisfiability and maximum satisfiability of random 3-CNF formulas. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 322-330.
13. A. Frieze, S. Suen. Analysis of two simple heuristics for random instances of k-SAT. In J. Algorithms 20 (1996) 312-355.
14. T. Hofmeister, U. Schoning, R. Schuler O. Watanabe. Probabilistic 3-SAT Algorithm Further Improved. In Proc. 19th STACS, LNCS 2285:193-202, 2002.
15. K. Iwama, S. Tamaki. Improved Bounds for 3-SAT. In ECCC report no. 53, 2003.
16. Crawford, J. M., and Auton, L. D. Experimental Results on the Crossover Point in Random 3-SAT. In Artificial Intelligence, 81:31-57.
17. U. Feige. Relations Between Average Case Complexity and Approximation Complexity. In Proc. of STOC 2002, Montreal.
18. E. Friedgut. Sharp Thresholds of Graph Properties, and the k-sat Problem. In J. Amer. Math. Soc. 12 (1999), no. 4, 1017-1054.
19. Z. Füredi. Random Polytopes in the d-Dimensional Cube. In Discrete Computational Geometry (1) pp. 315-319 (1986)
20. A. Kaporis, L. M. Kirousis, and E. G. Lalas. The probabilistic analysis of a greedy satisfiability algorithm. In 10th Annual European Symposium on Algorithms (Rome, Italy, 2002).
21. Kirpatrick S., C.D. Gelatt, M.P. Vecchi Optimization by simulated annealing. In Science 220, 671-680 (1983).
22. Luby M., M. Mitzenmacher, and A. Shokrollahi. Analysis of Random Processes via And-Or Tree Evaluation. In Proceeding of ACM-SIAM Symposium on Discrete Algorithms, 1998.
23. Motwani R., P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
24. Papadimitriou, C. H. On selecting a satisfying truth assignment. In Proceedings of the 32nd Annual IEEE FOCS'91, pages 163-169.
25. Parkes, A. J. Personal Communication.
26. n)) - Improving Randomized Local Search by Initializing Strings of 3-Clauses. In ECCC report No. 54, 2003.
27. Schoning, U. A probabilistic algorithm for k-SAT and constraint satisfaction problems, In Proc. FOCS'99, pp.410-414, 1999.
28. Selman, B. Personal Communication
29. Selman, B., H. Kautz Local Search Strategies for Satisfiability Testing In DIMACS Series in Discrete Mathematics. (to appear)
30. Selman B., Levesque H., Mitchell, D. A New Method For Solving Hard Satisfiability Problems. In Proc. of the Tenth Natl. Conference on Artificial Intelligence (AAAI-92), San Jose, CA, 1992, 440-446.