Achlioptas, Dimitris, Coja-Oghlan, Amin and Ricci-Tersenghi, F. (Federico). (2011) On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, Volume 38 (Number 3). pp. 251-268. ISSN 10429832

Full text not available from this repository.

Abstract

For various random constraint satisfaction problems there is a significant gap between the largest constraint density for which solutions exist and the largest density for which any polynomial time algorithm is known to find solutions. Examples of this phenomenon include random k-SAT, random graph coloring, and a number of other random constraint satisfaction problems. To understand this gap, we study the structure of the solution space of random k-SAT (i.e., the set of all satisfying assignments viewed as a subgraph of the Hamming cube). We prove that for densities well below the satisfiability threshold, the solution space decomposes into an exponential number of connected components and give quantitative bounds for the diameter, volume, and number.© 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 251–268, 2011

Item Type:	Journal Article
Subjects:	Q Science > QC Physics
Divisions:	Faculty of Science > Computer Science Faculty of Science > Mathematics
Library of Congress Subject Headings (LCSH):	Statistical mechanics, Computational complexity, Constraints (Artificial intelligence) -- Mathematics
Journal or Publication Title:	Random Structures & Algorithms
Publisher:	John Wiley & Sons, Inc.
ISSN:	10429832
Date:	May 2011
Volume:	Volume 38
Number:	Number 3
Page Range:	pp. 251-268
Identification Number:	10.1002/rsa.20323
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Funder:	National Science Foundation (U.S.) (NSF), Alfred P. Sloan Foundation, European Research Council (ERC), Deutsche Forschungsgemeinschaft (DFG)
Grant number:	CCF-0546900 (NSF), 210743 (ERC), CO 646 (DFG)
References:	[1] D. Achlioptas and A. Coja-Oghlan, Algorithmic barriers from phase transitions, In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08), Philadelphia, PA, 2008, pp. 793–802. [2] D. Achlioptas and C. Moore, The asymptotic order of the random k-SAT threshold, In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS’02), Vancouver, BC, Canada, 2002, pp. 126–127. [3] D. Achlioptas, A. Naor, andY. Peres, Rigorous location of phase transitions in hard optimization problems, Nature 435 (2005), 759–764. [4] D. Achlioptas and Y. Peres, The threshold for random k-SAT is 2k ln 2−O(k), J Am Math Soc 17 (2004), 947–973. [5] D. Achlioptas and F. Ricci-Tersenghi, Random formulas have frozen variables, SIAM J Comput 39 (2009), 260–280. [6] J. Ardelius and L. Zdeborova, Exhaustive enumeration unveils clustering and freezing in random 3-SAT, Phys Rev E 78 (2008), 040101(R). [7] O. Dubois and Y. Boufkhad, A general upper bound for the satisfiability threshold of random r-SAT formulae, J Algorithms 24 (1997), 395–420. [8] O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-SAT formulae and the satisfiablity threshold, Electro Colloq Comput Complex 10 (2003). [9] P. Erd˝os and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 7 (1987), 35–38. [10] E. Friedgut, Sharp thresholds of graph proprties, and the k-SAT problem, J Amer Math Soc 12 (1999), 1017–1054. [11] E. Friedgut, Hunting for sharp thresholds, Random Struct Algorithms 26 (2005), 37–51. [12] A. M. Frieze and S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J Algorithms 20 (1996), 312–355. [13] A. C. Kaporis, L. M. Kirousis, and E. G. Lalas, Selecting complementary pairs of literals, Electron Notes Discrete Math 16 (2003), 47–70. [14] L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou, Approximating the unsatisfiability threshold of random formulas, Random Struct Algorithms 12 (1998), 253–269. [15] F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborova, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc Natl Acad Sci USA 104 (2007), 10318–10323. [16] M. Mézard, T. Mora, and R. Zecchina, Clustering of solutions in the random satisfiability problem, Phys Rev Lett 94 (2005), 197205. [17] H. Daudé, M. Mezard, T. Mora, and R. Zecchina, Pairs of SAT assignment in random Boolean formulae, Theoretical Computer Science 393 (2008), 260–279. [18] M. Mézard, G. Parisi, and R. Zecchina, Analytic and algorithmic solution of random satisfiability problems, Science 297 (2002), 812–815. [19] R. E. A. C. Paley and A. Zygmund, A note on analytic functions in the unit circle, Proc Camb Phil Soc 28 (1932), 266–272.
URI:	http://wrap.warwick.ac.uk/id/eprint/41294

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item