Resolution complexity of random constraint satisfaction problems: Another half of the story

@article{Gao2005ResolutionCO,
  title={Resolution complexity of random constraint satisfaction problems: Another half of the story},
  author={Yong Gao and Joseph C. Culberson},
  journal={Discrete Applied Mathematics},
  year={2005},
  volume={153},
  pages={124-140}
}
Let C2,k,t n,m be a random constraint satisfaction problem (CSP) on n binary variables, where m constraints are selected uniformly at random from all the possible k-ary constraints each of which contains exactly t tuples of the values as its restrictions. We establish an upper bound on the constraint tightness threshold for C2,k,t n,m to have an exponential resolution complexity. The upper bound partly answers the open problem regarding the CSP resolution complexity with the tightness between… CONTINUE READING