Browsing Mathematics by Author "2013. ACM"
Now showing items 1-2 of 2
-
The expressibility of functions on the Boolean domain, with applications to Counting CSPs
Bulatov, A; Dyer, M; Goldberg, LA; Jerrum, M; McQuillan, C (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 ... -
The Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPs
Bulatov, AA; Dyer, M; Goldberg, LA; Jerrum, M; Mcquillan, C (2013-10)