Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms
From MaRDI portal
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 -model, and binary constraint satisfaction problems with domain size 3.
This page was built for publication: Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478432)
