Pushing random walk beyond golden ratio

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

Volumn 4649 LNCS, Issue , 2007, Pages 44-55

  Amiri, Ehsan ^a   Skvortsov, Evgeny ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; PROBLEM SOLVING;

FULL CNF; PLANTED SOLUTION; RANDOM CNFS; RANDOM WALK ALGORITHM;

ALGORITHMS;

EID: 37249011817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74510-5_8     Document Type: Conference Paper

References (9)

1. Achlioptas, D., Sorkin, G.B.: Optimal myopie algorithms for random 3-SAT. In: IEEE Symposium on Foundations of Computer Science, pp. 590-600 (2000)
2. Alekhnovich, M., Ben-Sasson, E.: Analysis of the random walk algorithm on random 3-CNFs Technical Report ECCC TR04-016 (2002)
3. Bulatov, A.A., Skvortsov, E.S.: Efficiency of local search. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 297-310. Springer, Heidelberg (2006)
4. Flaxman, A.: A spectral technique for random satisfiable 3-cnf formulas. In: SODA 2003, pp. 357-363 (2003)
5. Koutsoupias, E., Papadimitriou, C.: On the greedy algorithm for satisfiability. Information Processing Letters 43(1), 53-55 (1992)
6. Raghavan, P., Motwani, R.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
7. Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: Proceedings of the 32nd Annual IEEE FOCS'91, pp. 163-169 (1991)
8. Feige, U., Vilenchik, D.: A local search algorithm for 3sat. Technical report, The Weizmann Institute of Science (2004)
9. Wormald, N.: Differential equations for random processes and random graphs. The Annals of Applied Probability 5(4), 1217-1235 (1995)