From spin glasses to hard satisfiable formulas

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 199-210

  Jia, Haixia ^a   Moore, Cris ^a,b   Selman, Bart ^c  

^a University of New Mexico   (United States)

^b UNIVERSITY OF NEW MEXICO   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; RANDOM PROCESSES; SEARCH ENGINES;

LOCAL SEARCH ALGORITHMS; PARITY FORMULAS; RECORD-TO-RECORD TRAVEL (RRT); SURVEY PROPAGATION (SP);

STATISTICAL METHODS;

EID: 26444603429     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_16     Document Type: Conference Paper

References (27)

1. D. Achlioptas, C. Gomes, H. Kautz, and B. Selman, Generating satisfiable problem instances. Proc. AAAI '00 256-261.
2. D. Achlioptas, H. Jia, and C. Moore, Hiding satisfying assignments: two are better than one. Submitted.
3. Y. Asahiro, K. Iwama, and E. Miyano, Random generation of test instances with controlled attributes. In [8], op. cit.
4. W. Barthel, A.K. Hartmann, M. Leone, F. Ricci-Tersenghi, M. Weigt, and R. Zecchina, Hiding solutions in random satisfiability problems: a statistical mechanics approach. Phys. Rev. Lett. 88 (2002) 188701.
5. R.J. Baxter, "Hard hexagons: exact solution." J. Physics A 13 (1980) 1023-1030.
6. S. Cocco, O. Dubois, J. Mandler, and R. Monasson, Rigorous decimation-based construction of ground pure states for spin glass models on random lattices. Phys. Rev. Lett. 90(4) (2003) 047205.
7. J.M. Crawford and M.J. Kearns, The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem, ftp://dimacs.rutgers.edu/pub/challenge/ satisfiability/benchmarks/cnf/
8. and J.M. Crawford, M.J. Kearns, and R.E. Schapire, The minimal disagreement parity problem as a hard satisfiability problem. Technical report, CIRL, 1994.
9. Second DIMACS Implementation Challenge, 1993. Published as DIMACS Series in Disc. Math. and Theor. Comp. Sci. vol. 26, D. Johnson and M. Trick, Eds. AMS, 1996.
10. G. Dueck, New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comp. Phys. 104 (1993) 86-92.
11. S. Franz, M. Mézard, F. Ricci-Tersenghi, M. Weigt, and R. Zecchina, A ferromagnet with a glass transition. Europhys. Lett. 55 (2001) 465.
12. J.P. Garrahan and M.E.J. Newman, Glassiness and constrained dynamics of short-range non-disordered spin model. Phys. Rev. E 62 (2000) 7670-7678.
13. E.A. Hirsch, hgen2 formula generator source site, http://logic.pdmi.ras. ru/hirsch/
14. A. E. Holroyd, Sharp metastability threshold for two-dimensional bootstrap percolation. Prob. Theory and Related Fields 125 (2003) 195-224.
15. H.H. Hoos, SATLIB, A collection of SAT tools and data, www.informatik.tudarmstadt.de/AI/SATLIB
16. H. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, and M. Stickel, Balance and Filtering in Structured Satisfiable Problems. Proc. IJCAI '01 351-358.
17. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina, Alternative solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys. 111 (2003) 505.
18. M. Mézard and R. Zecchina, Random K-satisfiability: from an analytic solution to a new efficient algorithm. Phys. Rev. E 66 (2002).
19. See also A. Braunstein, M. Mézard, M., and R. Zecchina, Survey propagation: an algorithm for satisfiability. Preprint, 2002, http://www.ictp.trieste.it/~zecchina/SP/.
20. M.E.J. Newman and C. Moore, Glassy Dynamics in an Exactly Solvable Spin Model. Phys. Rev. E 60 (1999) 5068-5072.
21. S. Seitz and P. Orponen, An efficient local search method for random 3-satisfiability. LICS'03, workshop on Typical Case Complexity and Phase Transitions. Electronic Notes in Discrete Mathematics 16 (2003).
22. B. Selman, H.A. Kautz, and B. Cohen, Noise strategies for improving local search. Proc. AAAI (1994).
23. P. Shaw, K. Stergiou, and T. Walsh, Arc consistency and quasigroup completion. ECAI '98, workshop on binary constraints.
24. F. Ricci-Tersenghi, M. Weigt, and R. Zecchina, Simplest random K-satisfiability problem. Phys. Rev. E 63 (2001) 026702.
25. SAT2003 Competition result site, http://www.satlive.org/SATCompetition/ 2003/results.html
26. A. Van Gelder, Problem generator mkcnf. c contributed to the DIMACS 1993 Challenge archive.
27. L. Zhang, zChaff source site, http://ee.princeton.edu/~chaff/zChaff.php