Computational complexity and phase transitions

Phase transitions in combinatorial problems have recently been shown to be useful in locating “hard” instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been addressed in statistical mechanics and artificial intelligence, but not studied rigorously. We take a first step in this direction by investigating the existence of sharp thresholds for the class of generalized satisfiability problems, defined by T.J. Schaefer (1978). In the case when all constraints have a special clausal form we completely characterize the generalized satisfiability problems that have a sharp threshold. While NP-completeness does not imply the sharpness of the threshold, our result suggests that the class of counter examples is rather limited, as all such counter examples can be predicted, with constant success probability by a single procedure