Decimation flows in constraint satisfaction problems

Details Decimation flows in constraint satisfaction problems Decimation flows in constraint satisfaction problems

2009-08-12

arxiv.org/abs/0908.1599v1

J. Stat. Mech. (2009) P12009

Physics

Condensed Matter

Disordered Systems and Neural Networks

14 pages, 2 figures

Scientific paper

10.1088/1742-5468/2009/12/P12009

We study hard constraint satisfaction problems with a decimation approach based on message passing algorithms. Decimation induces a renormalization flow in the space of problems, and we exploit the fact that this flow transforms some of the constraints into linear constraints over GF(2). In particular, when the flow hits the subspace of linear problems, one can stop decimation and use Gaussian elimination. We introduce a new decimation algorithm which uses this linear structure and shows a strongly improved performance with respect to the usual decimation methods on some of the hardest locked occupation problems.

Affiliated with

Also associated with

No associations

Rating

Decimation flows in 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 Decimation flows in constraint satisfaction problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decimation flows in constraint satisfaction problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-369834