加载中…
2010-10-27
PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems
Dominik Scheder
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本