Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity
Gabriel Istrate, Stefan Boettcher, Allon G. Percus

TL;DR
This paper explores the relationship between phase transition phenomena and computational complexity in random constraint satisfaction problems, introducing the spine order parameter and linking discontinuities to exponential resolution complexity.
Contribution
It extends the definition of the spine to random CSPs and rigorously connects spine discontinuity with high decision complexity, providing new theoretical insights.
Findings
Discontinuity of the spine correlates with exponential resolution complexity.
Random CSPs with sharp thresholds and continuous spine resemble random 2-SAT.
The spine's behavior impacts the decision complexity more than the backbone.
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 Bollobas et al. to random constraint satisfaction problems, rigorously showing that for such problems a discontinuity of the spine is associated with a resolution complexity (and thus a 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Data Management and Algorithms · Advanced Graph Theory Research
