Hiding satisfying assignments: Two are better than one

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 623-639

  Achlioptas, Dimitris ^a   Jia, Haixia ^b   Moore, Cristopher ^b  

^a MICROSOFT RESEARCH   (United States)

^b MSC01 1070   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HARDNESS; HEURISTIC METHODS; MATHEMATICAL MODELS; MOTIVATION;

CLAUSES; HIDDEN ASSIGNMENT; SYMMETRIZATION; TRUTH ASSIGNMENT;

RANDOM PROCESSES;

EID: 31144465450     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1681     Document Type: Article

References (32)

1. Achlioptas, D. (2001). Lower bounds for random 3-SAT via differential equations. Theor. Comp. Sci., 265, 159-185.
2. Achlioptas, D., Beame, P., & Molloy, M. (2001). A sharp threshold in proof complexity. In Proc. STOC, pp. 337-346.
3. Achlioptas, D., Gomes, C., Kautz, H., & Selman, B. (2000). Generating satisfiable problem instances. In Proc. AAAI, pp. 256-261
4. Achlioptas, D., & Moore, C. (2002a). Almost all graphs with average degree 4 are 3-colorable. In Proc. STOC, pp. 199-208.
5. Achlioptas, D., & Moore, C. (2002b). The asymptotic order of the random k-SAT threshold. In Proc. FOCS, pp. 779-788.
6. Achlioptas, D., & Moore, C. (2005). Two moments suffice to cross a sharp threshold. In SIAM J. Comput. To appear.
7. Asahiro, Y., Iwama, K., & Miyano, E. (1996). Random generation of test instances with controlled attributes. DIMACS Series in Disc. Math. and Theor. Comp. Sci., 26, 377-393.
8. Barthel, W., Hartmann, A., Leone, M., Ricci-Tersenghi, F., Weigt, M., & Zecchina, R. (2002). Hiding solutions in random satisfiability problems: A statistical mechanics approach. Phys. Rev. Lett., 88 (188701).
9. Chao, M., & Franco, J. (1986). Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput., 15(4), 1106-1118.
10. Cheeseman, P., Kanefsky, R., & Taylor, W. (1991). Where the really hard problems are. In Proc. IJCAI, pp. 163-169.
11. Cocco, S., & Monasson, R. (2001a). Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms. Eur. Phys. J. B, 22, 505-531.
12. Cocco, S., & Monasson, R. (2001b). Trajectories in phase diagrams, growth processes and computational complexity: how search algorithms solve the 3-satisfiability problem. Phys. Rev. Lett, 86, 1654-1657.
13. Du, D., Gu, J., & Pardalos, P. (1997). Dimacs workshop on the satisfiability problem, 1996. In DIMACS Discrete Math. and Theor. Comp. Sci., Vol. 35. AMS.
14. Hajiaghayi, M., & Sorkin, G. (2003). The satisfiability threshold for random 3-SAT is at least 3.52..
15. Hogg, T., Huberman, B., & Williams, C. (1996). Phase transitions and complexity. Artificial Intelligence, 81. Special issue.
16. Johnson, D., & Trick, M. (1996). Second dimacs implementation challenge, 1993. In DIMACS Series in Disc. Math. and Theor. Comp. Sci., Vol. 26. AMS.
17. Johnson, D., Aragon, C., McGeoch, L., & Shevon, C. (1989). Optimization by simulated annealing: an experimental evaluation. Operations Research, 57(6), 865-892.
18. Kaporis, A., Kirousis, L., & Lalas, E. (2003). Selecting complementary pairs of literals. In Proc. LICS Workshop on Typical Case Complexity and Phase Transitions.
19. Kautz, H., Ruan, Y., Achlioptas, D., Gomes, C., Selman, B., & Stickel. (2001). Balance and filtering in structured satisfiable problems. In Proc. IJCAI, pp. 351-358.
20. Kirousis, L., Kranakis, E., Krizanc, D., & Stamatiou, Y. (1998). Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms, 12(3), 253-269.
21. Li, C., & Anbulagan (1997a). Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI, pp. 366-371.
22. Li, C., & Anbulagan (1997b). Look-ahead versus look-back for satisfiability problems. In Proc. 3rd Intl. Conf. on Principles and Practice of Constraint Programming, pp. 341-355.
23. Massacci, F. (1999). Using walk-SAT and rel-SAT for cyptographic key search. In Proc. IJCAI, pp. 290-295.
24. Mézard, M., & Zecchina, R. (2002). Random k-satisfiability: from an analytic solution to a new efficient algorithm. Phys. Rev. E, 66. Available at: http://www.ictp.trieste.it/~zecchina/SP/.
25. Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proc. AAAI, pp. 459-465.
26. Monasson, R. (2005). Average case analysis of DPLL for random decision problems. In Proc. RANDOM.
27. Morris, P. (1993). The breakout method for escaping from local minima. In Proc. AAAI, pp. 40-45.
28. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: engineering an efficient SAT solver. In Proc. 38th Design Automation Conference, pp. 530-535.
29. Selman, B., Kautz, H., & Cohen, B. (1996). Local search strategies for satisfiability testing. In Proc. 2nd DIMACS Challange on Cliques, Coloring, and Satisfiability.
30. Shaw, P., Stergiou, K., & Walsh, T. (1998). Arc consistency and quasigroup completion. In Proc. ECAI, workshop on binary constraints.
31. Van Gelder, A. (1993). Problem generator mkcnf.c. In Proc. DIMACS. Challenge archive.
32. Wormald, N. (1995). Differential equations for random processes and random graphs. Ann. Appl. Probab., 5(4), 1217-1235.