Random subcubes as a toy model for constraint satisfaction problems

Details Random subcubes as a toy model for constraint satisfaction problems Random subcubes as a toy model for constraint satisfaction problems

2007-10-19

arxiv.org/abs/0710.3804v2

J. Stat. Phys. 131, n. 6 (2008), 1121-1138

Computer Science

Computational Complexity

21 pages, 4 figures

Scientific paper

10.1007/s10955-008-9543-x

We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-coloring problems, and undergoes the same phase transitions as these problems. The comparison becomes quantitative in the large-k limit. Distance properties, as well the x-satisfiability threshold, are studied. The model is also generalized to define a continuous energy landscape useful for studying several aspects of glassy dynamics.

Affiliated with

Also associated with

No associations

Rating

Random subcubes as a toy model for constraint satisfaction problems 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 Random subcubes as a toy model for constraint satisfaction problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random subcubes as a toy model for constraint satisfaction problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477198