52 citations · 146 across the 26 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019★ 7 cited
Approximate counting CSP seen from the other side
Andrei A. Bulatov, Stanislav Zivny
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP(,-), in which the goal is, given a relational structure $\ma…
cs.CC2019
Counting Homomorphisms Modulo a Prime Number
Amirhossein Kazeminia, Andrei A. Bulatov
Counting problems in general and counting graph homomorphisms in particular have numerous applications in combinatorics, computer science, statistical physics, and elsewhere. One o…