123
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...