Constraint Satisfaction by Survey Propagation

TL;DR

This paper introduces a formalism for applying Survey Propagation to a broad class of discrete Constraint Satisfaction Problems, extending its successful use beyond specific cases like 3-SAT and graph coloring.

Contribution

It generalizes the Survey Propagation algorithm, enabling its application to a wide range of constraint satisfaction problems.

Findings

Survey Propagation effectively solves random 3-SAT and 3-coloring problems.

The formalism broadens the applicability of Survey Propagation.

Results demonstrate success in the hard regions of problem parameter spaces.

Abstract

Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\frac{c}{n})$ graph 3-coloring, in the hard region of the parameter space. Here we provide a generic formalism which applies to a wide class of discrete Constraint Satisfaction Problems.