Abstract
We study the connection between the order of phase transitions in combinatorial problems and the complexity of decision algorithms for such problems. We rigorously show that, for a class of random constraint satisfaction problems, a limited connection between the two phenomena indeed exists. Specifically, we extend the definition of the spine order parameter of Bollobás et al. [10] to random constraint satisfaction problems, rigorously showing that for such problems a discontinuity of the spine is associated with a 2Ω(n) resolution complexity (and thus a 2Ω(n) complexity of DPLL algorithms) on random instances. The two phenomena have a common underlying cause: the emergence of “large” (linear size) minimally unsatisfiable subformulas of a random formula at the satisfiability phase transition.
We present several further results that add weight to the intuition that random constraint satisfaction problems with a sharp threshold and a continuous spine are “qualitatively similar to random 2-SAT”. Finally, we argue that it is the spine rather than the backbone parameter whose continuity has implications for the decision complexity of combinatorial problems, and we provide experimental evidence that the two parameters can behave in a different manner.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Achlioptas, A. Chtcherba, G. Istrate and C. Moore, The phase transition in random 1-in-k SAT and NAE 3SAT, in: Proc. of the 13th ACM-SIAM Symposium on Discrete Algorithms (2001). Journal version in preparation.
D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Structures and Algorithms 14(1) (1999) 63–70.
P. Beame, R. Karp, T. Pitassi and M. Saks, The efficiency of resolution and Davis–Putnam procedures, SIAM Journal of Computing 31(4) (2002) 1048–1075.
P. Beame and T. Pitassi, Propositional proof complexity: Past present and future, in: Current Trends in Theoretical Computer Science (2001) pp. 42–70.
E. Ben-Sasson and A. Wigderson, Short proofs are narrow: Resolution made simple, Journal of the ACM 48(2) (2001).
S. Boettcher, A extremal optimization of graph partition at the percolation threshold, J. Phys. Math. Gen. 32 (1999) 5201–5211.
S. Boettcher and A. Percus, Nature’s way of optimizing, Artificial Intelligence 119 (2000) 275–286.
S. Boettcher and A.G. Percus, Extremal optimization at the phase transition of the 3-coloring problem, Physical Review E 69 (2004) 066703.
B. Bollobás, Random Graphs (Academic Press, New York, 1985).
B. Bollobás, C. Borgs, J.T. Chayes, J.H. Kim and D.B. Wilson, The scaling window of the 2-SAT transition, Technical Report, Los Alamos e-print server, http://xxx.lanl.gov/ps/math.CO/9909031, 1999.
V. Chvátal and E. Szemerédi, Many hard examples for resolution, Journal of the ACM 35(4) (1988) 759–768.
N. Creignou and H. Daudé, Combinatorial sharpness criterion and phase transition classification for random CSPs, Information and Computation 190(2) (2004) 220–238.
J. Culberson and I. Gent, Frozen development in graph coloring, Theoretical Computer Science 265(1/2) (2001) 227–264.
E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem with an appendix by J. Bourgain, Journal of the AMS 12 (1999) 1017–1054.
N. Immerman, Descriptive Complexity, Springer Graduate Texts in Computer Science (Springer, Berlin, 1999).
G. Istrate, Phase transitions and all that, Preprint CS.CC/0211012, ACM Computer Repository at arXiv.org.
G. Istrate, Threshold properties of random constraint satisfaction problems, accepted to a special volume of Discrete Applied Mathematics on typical-case complexity and phase transitions.
G. Istrate, Descriptive complexity and first-order phase transitions (in progress).
J. Krajicek, On the weak pigeonhole principle, Fundamenta Matematicae 170(1–3) (2001) 123–140.
O. Martin, R. Monasson and R. Zecchina, Statistical mechanics methods and phase transitions in combinatorial optimization problems, Theoretical Computer Science 265(1/2) (2001) 3–67.
D. Mitchell, Resolution complexity of random constraints, in: Eigth International Conference on Principles and Practice of Constraint Programming (2002).
M. Molloy, Models for random constraint satisfaction problems, in: Proc. of the 32nd ACM Symposium on Theory of Computing (2002).
M. Molloy and M. Salavatipour, The resolution complexity of random constraint satisfaction problems, in: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003).
R. Monasson and R. Zecchina, Statistical mechanics of the random k-SAT model, Physical Review E 56 (1997) 1357.
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, Determining computational complexity from characteristic phase transitions, Nature 400(8) (1999) 133–137.
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition, Random Structures and Algorithms 15(3/4) (1999) 414–435.
M.A. Trick, color.c graph coloring code, available at http://mat.gsia.cmu.edu/COLOR/solvers/trick.c.
R. Mulet, A. Pagnani, M. Weigt and R. Zecchina, Coloring random graphs, Physical Review Letters 89 (2002) 268701.
F. Ricci-Tersenghi, M. Weigt and R. Zecchina, Simplest random k-satisfiability problem, Physical Review E 63 (2001) 026702.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification
68Q25, 82B27
Rights and permissions
About this article
Cite this article
Istrate, G., Boettcher, S. & Percus, A.G. Spines of random constraint satisfaction problems: definition and connection with computational complexity. Ann Math Artif Intell 44, 353–372 (2005). https://doi.org/10.1007/s10472-005-7033-2
Issue Date:
DOI: https://doi.org/10.1007/s10472-005-7033-2