Scaling properties of pure random walk on random 3-SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 708-713

  Parkes, Andrew J ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

NON-TRIVIAL; RANDOM WALK; SCALING PROPERTIES;

RANDOM PROCESSES;

EID: 84957019612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_50     Document Type: Conference Paper

References (13)

1. Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random boolean expressions. Science 264 (1994) 1297–1301
2. Friedgut, E.: Sharp thresholds of graph properties, and the k-SAT problem. Journal of the American Mathematical Society 12 (1999) 1017–1054
3. Goerdt: A remark on random 2-SAT. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 96 (1999)
4. Crawford, J.M., Auton, L. D.: Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81 (1996) 31–57
5. Achlioptas, D., Sorkin, G. B.: Optimal myopic algorithms for random 3-SAT. In: IEEE Symposium on Foundations of Computer Science (FOCS 00). (2000) 590–600
6. Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In Johnson, D. S., Trick, M.A., eds.: Cliques, Coloring and Satisfiability, American Mathematical Society (1996) 521–531
7. Broder, A. Z., Frieze, A. M., Upfal, E.: On the satisability and maximum satisability of random 3-CNF formulas. In: Proc. 4th Ann. ACM-SIAM SODA. (1993) 322–330
8. Hirsch, E.A.: SAT local search algorithms: Worst-case study. Journal of Automated Reasoning 24 (2000) 127–143
9. Papadimitriou, C.: On selecting a satisfying truth assignment. In: Proc. IEEE symposium on Foundations of Computer Science. (1991) 163–169
10. Parkes, A. J.: Easy predictions for the easy-hard-easy transition. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002). (2002)
11. Parkes, A. J., Walser, J. P.: Tuning Local Search for Satisfiability Testing. In: Proceedings of AAAI-96, Portland, OR (1996) 356–362
12. Ben-Sasson, E.: Personal communication (2002)
13. Parkes, A. J.: Distributed local search, phase transitions, and polylog time. In: Proc. “Stochastic Search Algorithms” workshop, IJCAI-01”. (2001)