PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems
Data Structures and Algorithms
2010-10-28 v1
Abstract
We analyze the so-called ppz algorithm for (d,k)-CSP problems for general values of d (number of values a variable can take) and k (number of literals per constraint). To analyze its success probability, we prove a correlation inequality for submodular functions.
Cite
@article{arxiv.1010.5717,
title = {PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems},
author = {Dominik Scheder},
journal= {arXiv preprint arXiv:1010.5717},
year = {2010}
}
Comments
18 pages