77 citations · 733 across the 54 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018★ 1 cited
The Complexity of Approximately Counting Retractions
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny
Let be a graph that contains an induced subgraph . A retraction from to is a homomorphism from to that is the identity function on . Retractions are very…
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…
cs.DM2018★ 1 cited
A tractable class of binary VCSPs via M-convex intersection
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota +1
A binary VCSP is a general framework for the minimization problem of a function represented as the sum of unary and binary cost functions. An important line of VCSP research is to…