Clustering of solutions in hard satisfiability problems

Details Clustering of solutions in hard satisfiability problems Clustering of solutions in hard satisfiability problems

2007-02-28

arxiv.org/abs/cond-mat/0702672v1

Physics

Condensed Matter

Statistical Mechanics

8 pages, 9 figures

Scientific paper

10.1088/1742-5468/2007/10/P10012

We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarity between different solutions found on the same problem instance we show that the solution space is shrinking as a function of alpha. We consider chains of satisfiability problems, where clauses are added sequentially. In each such chain, the overlap distribution is first smooth, and then develops a tiered structure, indicating that the solutions are found in well separated clusters. On chains of not too large instances, all solutions are eventually observed to be in only one small cluster before vanishing. This condensation transition point is estimated to be alpha_c = 4.26. The transition approximately obeys finite-size scaling with an apparent critical exponent of about 1.7. We compare the solutions found by a local heuristic, ASAT, and the Survey Propagation algorithm up to alpha_c.

Affiliated with

Also associated with

No associations

Rating

Clustering of solutions in hard satisfiability problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering of solutions in hard satisfiability problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering of solutions in hard satisfiability problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524456