Hiding satisfying assignments: Two are better than one

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 131-136

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

^a MICROSOFT RESEARCH   (United States)

^b University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH COLORING; HIDDEN ASSIGNMENTS; REAL-WORLD PROBLEMS; SYMMETRIZATION;

ALGORITHMS; CONSTRAINT THEORY; GEOMETRY; GRAPH THEORY; REAL TIME SYSTEMS; STOCHASTIC CONTROL SYSTEMS;

PROBLEM SOLVING;

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

References (25)

1. Achlioptas, D., and Moore, C. 2002a. Almost all graphs with average degree 4 are 3-colorable. STOC 199-208.
2. Achlioptas, D., and Moore, C. 2002b. The asymptotic order of the random k-sat threshold. FOCS 779-788.
3. Achlioptas, D.; Beame, P.; and Molloy, M. 2001. A sharp threshold in proof complexity. STOC 337-346.
4. Achlioptas, D.; Gomes, C.; Kautz, H.; and Selman, B. 2000. Generating satisfiable problem instances. AAAI 256-261.
5. Achlioptas, D. 2001. Lower bounds for random 3-sat via differential equations. Theor. Comp. Sci. 265:159-185.
6. Asahiro, Y.; Iwama, K.; and Miyano, E. 1996. Random generation of test instances with controlled attributes. DIMACS Series in Disc. Math. and Theor. Comp. Sci. 26.
7. Barthel, W.; Hartmann, A.; Leone, M.; Ricci-Tersenghi, F.; Weigt, M.; and Zecchina, R. 2002. Hiding solutions in random satisfiability problems: A statistical mechanics approach. Phys. Rev. Lett 88(188701).
8. Chao, M., and Franco, J. 1986. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput. 15(4): 1106-1118.
9. Cheeseman, P.; Kanefsky, R.; and Taylor, W. 1991. Where the really hard problems are. IJCAI 163-169.
10. Cocco, S., and Monasson, R. 2001a. Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms. Eur. Phys. J. B 22:505-.
11. Cocco, S., and Monasson, R. 2001b. Trajectories in phase diagrams, growth processes and computational complexity: how search algorithms solve the 3-satisfiability problem. Physical Review Letters 86:1654-.
12. Hogg, T.; Huberman, B.; and Williams, C. 1996. Phase transitions and complexity. Artificial Intelligence 81. special issue.
13. Johnson, D.; Aragon, C.; McGeoch, L.; and C., S. 1989. Optimization by simulated annealing: An experimental evaluation. Operations Research 37(6):865-892.
14. Kautz, H.; Ruan, Y.; Achlioptas, D.; Gomes, C.; Selman, B.; and Stickel, M. 2001. Balance and filtering in structured satisfiable problems. IJCAI 351-358.
15. Kirousis, L.; Kranakis, E.; Krizanc, D.; and Stamatiou, Y. 1998. Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms 12(3):253-269.
16. Li, C. 1997. Anbulagan, heuristics based on unit propagation for satisfiability problems. IJCAI 366-371.
17. Massacci, F. 1999. Using walk-sat and rel-sat for cyptographic key search. IJCAI '99 290-295.
18. Mézard, M., and 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/.
19. Mitchell, D.; Selman, B.; and Levesque, H. 1992. Hard and easy distributions of sat problems. AAAI 459-465.
20. Morris, P. 1993. The breakout method for escaping from local minima. AAAI 40-45.
21. Selman, B.; Kautz, H.; and Cohen, B. 1996. Local search strategies for satisfiability testing. 2nd DIMACS Challange on Cliques, Coloring, and Satisfiability.
22. Shaw, P.; Stergiou, K.; and Walsh, T. 1998. Arc consistency and quasigroup completion. ECAI, workshop on binary constraints.
23. Van Gelder, A. 1993. Problem generator mkcnf. c. DIMACS. Challenge archive.
24. Wormald, N. 1995. Differential equations for random processes and random graphs. Ann. Appl. Probab. 5(4): 1217-1235.
25. Zhang, L. zchaff source site. Available at: http://ee.princeton.edu/ ~chaff/zchaff.php.