Threshold properties of random boolean constraint satisfaction problems

Authors:
Gabriel Istrate
Affiliations:
CCS-5, Basic and Applied Simulation Science, Los Alamos National Laboratory, Mail Stop M 997, Los Alamos, NM 87545, USA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 7
Cited 0

A sharp threshold for k-colorability

Random Structures & Algorithms
Statistical mechanics methods and phase transitions in optimizationproblems

Theoretical Computer Science - Phase transitions in combinatorial problems
Models and thresholds for random constraint satisfaction problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The phase transition in random horn satisfiability and its algorithmic implications

Random Structures & Algorithms
Computational Complexity and Phase Transitions

COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Generalized satisfiability problems: minimal elements and phase transitions

Theoretical Computer Science
Combinatorial sharpness criterion and phase transition classification for random CSPs

Information and Computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [Models for random constraint satisfaction problems, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, 2002]. We give a sufficient condition for the existence of a sharp threshold. In the boolean case, it gives an independent proof for the more difficult half of a classification result conjectured by Creignou and Daude [Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302(1-3) (2003) 417-430], proved in a restricted case by the same authors [Combinatorial sharpness criterion and phase transition classification for random CSPs, Inform. Comput. 190(2) (2004) 220-238], and established by them [Coarse and sharp thresholds for random generalized satisfiability problems, in: M. Drmota, P. Flajolet, D. Gardy, B. Gittenberger (Eds.), Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities, Birkhauser, Basel, September 2004, pp. 507-517] while this paper was in the refereeing process.