On the average similarity degree between solutions of random k-SAT and random CSPs

Discrete Applied Mathematics

Volumn 136, Issue 1, 2004, Pages 125-149

  Xu, Ke ^a   Li, Wei ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Constraint satisfaction; Phase transition; SAT; Similarity degree

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; PHASE TRANSITIONS; PROBLEM SOLVING;

CONSTRAINT SATISFACTION; THRESHOLD POINT;

RANDOM PROCESSES;

EID: 0346960981     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00204-X     Document Type: Article

References (24)

1. D. Achlioptas, Setting 2 variables at a time yields a new lower bound for 3-SAT, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 28-37.
2. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, Rigorous Results for Random (2+p) -SAT, in: Proceedings of RALCOM-97, pp. 1-10.
3. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy, Y.C. Stamatiou, Random constraint satisfaction: a more accurate picture. Constraints, in: Proceedings of CP97, Springer, Berlin, 1997, pp. 107-120, to appear.
4. G. Biroli, R. Monasson, M. Weigt, A variational description of the ground state structure in random satisfiability problems, Eur. Phys. J. B, to be published.
5. P. Cheeseman, B. Kanefsky, W. Taylor, Where the really hard problems are, in: Proceedings of IJCAI-91, 1991, pp. 331-337.
6. V. Chvátal, B. Reed, Mick Gets Some (the Odds Are on His Side), in: Proceedings of 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 620-627.
7. Dechter R. Constraint networks. Shapiro S. Encyclopedia of Artificial Intelligence. 2nd Edition:1992;276-285 Wiley, New York.
8. I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, T. Walsh, Random Constraint Satisfaction: Flaws and Structure. Constraints, to appear. http://www.cs.strath.edu.uk/̃apes/apereports.html
9. A. Goerdt, A threshold for unsatisfiability, in: Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science, Prague, August 1992.
10. Kirkpatrick S., Selman B. Critical behavior in the satisfiability of random boolean expressions. Science. 264:1994;1297-1301.
11. Kirousis L.M., Kranakis E., Krizanc D., Stamatiou Y.C. Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms. 12:1998;253-269.
12. D.E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1975.
13. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of AAAI-92, 1992, pp. 459-465.
14. Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. Determining computational complexity from characteristic 'phase transitions'. Nature. 400:1999;133-137.
15. Pan C., Yu X. Asymptotic Analysis. 1983;Shandong Publishing House of Science and Technology, Jinan, China. (in Chinese).
16. A.J. Parkes, Clustering at the Phase Transition, in: Proceedings of AAAI-97, 1997, pp. 340-345.
17. Petris D. Equilibrium statistical mechanics of frustrated spin glasses. a survey of mathematical results Ann. Inst. H. Poincare Phys. Theor. 64:1996;255-288.
18. Prosser P. An empirical study of phase transitions in binary constraint satisfaction problems. Artif. Intell. 81:1996;81-109.
19. Purdom P.W., Brown C.A. An average time analysis of backtracking. SIAM J. Comput. 10:1981;583-593.
20. Smith B.M., Dyer M.E. Locating the phase transition in binary constraint satisfaction problems. Artif. Intell. 81:1996;155-181.
21. Williams C., Hogg T. Exploiting the deep structure of constraint problems. Artif. Intell. 70:1994;73-117.
22. Xu K., Li W. The SAT Phase Transition. Sci. China, Series E. 42:1999;494-501.
23. Xu K., Li W. Exact phase transitions in random constraint satisfaction problems. J. Artif. Intell. Res. 12:2000;93-103.
24. Xu K., Li W. An average analysis of backtracking on random constraint satisfaction problems. Ann. Math. Artif. Intell. 33:2001;21-37.