activity
20112018
most citedThe expressibility of functions on the Boolean domain, with applications to Counting CSPs

24 citations · 60 across the 8 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.CC2018★ 3 cited

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg +2

We analyse the complexity of approximate counting constraint satisfactions problems , where is a set of nonnegative rational-valued funct…