Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

JUCS

2007

2007

: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonrigorous methods from Statistical Physics support the validity of the one step replica symmetry breaking approach. Some of these predictions were rigorously conﬁrmed in [M´ezard et al. 2005a] [M´ezard et al. 2005b]. There it is proved that the overlap distribution of random k-SAT, k ≥ 9, has discontinuous support. Furthermore, Achlioptas and Ricci-Tersenghi [Achlioptas and Ricci-Tersenghi 2006] proved that, for random k-SAT, k ≥ 8, and constraint densities close enough to the phase transition: – there exists an exponential number of clusters of satisfying assignments. – the distance between satisfying assignments in diﬀerent clusters is linear. We aim to understand the structural properties of random CSP that lead to solution clustering. To this end, we prove two results on the cluster structure o...

Related Content

Added |
16 Dec 2010 |

Updated |
16 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
JUCS |

Authors |
Gabriel Istrate |

Comments (0)