Sharp thresholds for constraint satisfaction problems and homomorphisms - Mathematics > CombinatoricsReport as inadecuate




Sharp thresholds for constraint satisfaction problems and homomorphisms - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: We determine under which conditions certain natural models of randomconstraint satisfaction problems have sharp thresholds of satisfiability. Thesemodels include graph and hypergraph homomorphism, the $d,k,t$-model, andbinary constraint satisfaction problems with domain size three.



Author: Hamed Hatami, Michael Molloy

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents