Solving random satisfiable 3CNF formulas in expected polynomial time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 454-463

  Krivelevich, Michael ^a   Vilenchik, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; TIME SERIES ANALYSIS;

3CNF FORMULAS; 3SAT DISTRIBUTION; POLYNOMIAL TIME;

RANDOM PROCESSES;

EID: 33244463025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109608     Document Type: Conference Paper

References (31)

1. N. Alon and N. Kahale. A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput., 26 (1997), pp. 1733-1748.
2. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. Random Structures and Algorithms, 13 (1998), pp. 457-466.
3. N. Alon and J. H. Spencer. The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000.
4. R. Beier and B. Vöcking. Random knapsack in expected polynomial time. J. Comput. and Syst. Sci. 69 (2004), pp. 306-329.
5. E. Ben Sasson, Y. Bilu, and D. Gutfreund. Finding a randomly planted assigment in a random 3CNF. manuscript, 2002.
6. E. A. Bender and H. S. Wilf. A theoretical analysis of backtracking in the graph coloring problem. J. of Algorithms, 6 (1985), pp. 275-282.
7. A. Blum and J. Spencer. Coloring random and semirandom k-colorable graphs. J. of Algorithms, 19 (1995), pp. 204-234.
8. J. Böttcher. Coloring sparse random k-colorable graphs in polynomial expected time. In Proc. 30th International Symp. on Mathematical Foundations of Computer Science. Lecture Notes in Comput. Sci. 3618 (2005), pp. 156-167.
9. B. Cha and K. Iwama. Performance test of local search algorithms using new types of random CNF formulas. In Proc. 14th International Joint Conference on Artificial Intelligence, pp. 304-311, 1995.
10. A. Coja-Oghlan. Coloring semirandom graphs optimally. In Proc. 31st International Colloquium on Automata, Languages, and Programming, pp. 383-395, 2004.
11. A. Coja-Oghlan. Finding large independent sets in polynomial expected time. In Proc. 20th Symp. on Theoretical Aspects of Comp. Science. Lecture Notes in Comput. Sci. 2607 (2003), pp. 511-522.
12. A. Coja-Oghlan, A. Goerdt, A. Lanka, and F. Schädlich. Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theoret. Computer Sci., 329 (2004), pp. 1-45.
13. A. Coja-Oghlan and A. Taraz. Colouring random graphs in expected polynomial time. In Proc. 20th Symp. on Theoretical Aspects of Comp. Science. Lecture Notes in Gomput. Sci. 2607 (2003), pp. 487-498.
14. S. A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symp. on Theory of Computing, pp. 151-158, 1971.
15. J. M. Crawford and L. D. Auton. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence, 81 (1996), pp. 31-57.
16. M. Dyer and A. Frieze. The solution of some random NP-hard problems in polynomial expected time. J. of Algorithms, 10 (1989), pp. 451-489.
17. U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Structures and Algorithms, 16 (2000), .pp 195-208.
18. U. Feige and D. Vilenchik. A local search algorithm for 3SAT. Technical report, The Weizmann Institute of Science, 2004.
19. A. Flaxman. A spectral technique for random satisfiable 3CNF formulas. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 357-363, 2003.
20. E. Friedgut. Sharp thresholds of graph properties, and the k-sat problem. J. Amer. Math. Soc., 12 (1999), pp. 1017-1054.
21. A. Frieze and C. McDiarmid. Algorithmic theory of random graphs. Random Structures and Algorithms, 10 (1997), pp. 5-42.
22. M. Fürer, C. R. Subramanian, and C. E. Veni Madhavan. Coloring random graphs in polynomial expected time. In Proc. 4th Annual International Symposium on Algorithms and Computation. Lecture Notes in Comput. Sci., 762 (1993), pp. 31-37.
23. I. Gent. On the stupid algorithm for satisfiability. Technical report, Strathclyde University, 1998.
24. A. C. Kaporis, L. M. Kirousis, and E. G. Lalas. The probabilistic analysis of a greedy satisfiability algorithm. In Proc. 10th Annual European Symposium on Algorithms. Lecture Notes in Comput. Sci., 2461 (2002), pp. 574-585.
25. A. C. Kaporis, L. M. Kirousis, Y. C. Stamatiou, M. Vamvakari, and M. Zito. Coupon collectors, q-binomial coefficients and the unsatisfiability threshold. In Proc. Theoretical Computer Science: 7th Italian Conference. Lecture Notes in Comput. Sci., 2202 (2001), pp. 328-338.
26. E. Koutsoupias and C. H. Papadimitriou. On the greedy algorithm for satisfiability. Info. Process. Letters, 43 (1992), pp. 53-55. 1992.
27. M. Krivelevich. Deciding k-colorability in expected polynomial time. Info. Process. Letters, 81 (2002), pp. 1-6.
28. M. Krivelevich and V. H. Vu. Approximating the independence number and the chromatic number in expected polynomial time. J. Comb. Optim., 6 (2002), pp. 143-155.
29. H. J. Prömel and A. Steger. Coloring clique-free graphs in linear expected time. Random Structures and Algorithms, 3 (1992), pp. 375-402.
30. D. Vilenchik. Finding a satisfying assignment for semirandom satisfiable 3CNF formulas. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel, January 2004.
31. H. S. Wilf. Backtrack: an O(1) expected time algorithm for the graph coloring problem. Info. Process. Letters, 18 (1984), pp. 119-121.