Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms

Details Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms

2006-12-14

arxiv.org/abs/math/0612391v1

Mathematics

Combinatorics

Scientific paper

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 3.

Affiliated with

Also associated with

No associations

Rating

Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476931