The Resolution Complexity of Random Constraint Satisfaction Problems

Authors:
Michael Molloy;Mohammad Salavatipour
Affiliations:
-;-
Venue:
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Year:
2003

Citing 0
Cited 5

Spines of random constraint satisfaction problems: definition and connection with computational complexity

Annals of Mathematics and Artificial Intelligence
Resolution complexity of random constraint satisfaction problems: another half of the story

Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Many hard examples in exact phase transitions

Theoretical Computer Science
Consistency and random constraint satisfaction models

Journal of Artificial Intelligence Research
Resolution complexity of random constraint satisfaction problems: Another half of the story

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider random instances of constraint satisfaction problems where each variable has domain size d, and each constraint contains t restrictions on k variables. For each (d, k, t), we determine a sharp threshold for resolution complexity where the resolution complexity drops from a.s. exponential to a.s. polynomial when the clause density passes a specific value.