PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems

Details PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems

2010-10-27

arxiv.org/abs/1010.5717v1

Computer Science

Data Structures and Algorithms

18 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

PPZ For More Than Two Truth Values - An Algorithm 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 PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-485840