Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
Modular Counting CSP: Reductions and Algorithms
Amirhossein Kazeminia, Andrei A. Bulatov
The Constraint Satisfaction Problem (CSP) is ubiquitous in various areas of mathematics and computer science. Many of its variations have been studied including the Counting CSP, w…
cs.CC2021
Complexity classification of counting graph homomorphisms modulo a prime number
Andrei A. Bulatov, Amirhossein Kazeminia
Counting graph homomorphisms and its generalizations such as the Counting Constraint Satisfaction Problem (CSP), its variations, and counting problems in general have been intensiv…
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…