24 citations · 60 across the 8 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011★ 2 cited
LSM is not generated by binary functions
Colin McQuillan
The material in this note is now superseded by arXiv:1108.5288v4. Bulatov et al. [1] defined the operation of (efficient) pps_ω-definability in order to study the computational com…
cs.CC2011★ 24 cited
The expressibility of functions on the Boolean domain, with applications to Counting CSPs
Andrei A. Bulatov, Martin Dyer, Leslie Ann Goldberg +2
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…