Browsing Mathematics by Subject "approximation algorithms"
Now showing items 1-1 of 1
-
The expressibility of functions on the Boolean domain, with applications to Counting CSPs
(ACM Digital Library, 2013-10)An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a ...