Modular counting CSP: reductions and algorithms

Cites work

A dichotomy theorem for nonuniform CSPs
A proof of the CSP dichotomy conjecture
A Simple Algorithm for Mal'tsev Constraints
An effective dichotomy for the counting constraint satisfaction problem
Classifying the Complexity of Constraints Using Finite Algebras
Combinatorics and complexity of partition functions
Complexity classification of counting graph homomorphisms modulo a prime number
Complexity of counting CSP with complex weights
Counting homomorphisms to square-free graphs, modulo 2
Counting homomorphisms to trees modulo a prime
Handbook of product graphs
scientific article; zbMATH DE number 1545676 (Why is no real title available?)
scientific article; zbMATH DE number 7359806 (Why is no real title available?)
scientific article; zbMATH DE number 7788475 (Why is no real title available?)
On \(n\)-permutable congruences
On the algebraic structure of combinatorial problems
On the power of parity polynomial time
Polynomial-Time Approximation Algorithms for the Ising Model
Relations among MOD-classes
The complexity of computing the permanent
The complexity of counting homomorphisms seen from the other side
The complexity of counting homomorphisms to cactus graphs modulo 2
The Complexity of Enumeration and Reliability Problems
The complexity of partition functions
The complexity of the counting constraint satisfaction problem
The complexity of weighted Boolean \#CSP modulo \(k\)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Towards a dichotomy theorem for the counting constraint satisfaction problem

This page was built for publication: Modular counting CSP: reductions and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287799)