4 papers
Modular Counting over 3-Element and Conservative Domains
Andrei A. Bulatov, Amirhossein Kazeminia
In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure to a given relational structure $…
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…
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…
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…