Sharp thresholds for constraint satisfaction problems and homomorphisms

Authors:
Hamed Hatami;Michael Molloy
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada;Department of Computer Science, University of Toronto, Toronto, Canada
Venue:
Random Structures & Algorithms
Year:
2008

Citing 0
Cited 3

On Random Ordering Constraints

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On random betweenness constraints

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On random betweenness constraints

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the (d,k,t)-model, and binary constraint satisfaction problems with domain size three. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008