Hard enumeration problems in geometry and combinatorics
SIAM Journal on Algebraic and Discrete Methods
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Dempster's rule of combination is #P-complete (research note)
Artificial Intelligence
On the number of list-colorings
Journal of Graph Theory
Complexity of generalized satisfiability counting problems
Information and Computation
On the hardness of approximate reasoning
Artificial Intelligence
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
On the algebraic structure of combinatorial problems
Theoretical Computer Science
The Complexity of Planar Counting Problems
SIAM Journal on Computing
On Approximately Counting Colorings of Small Degree Graphs
SIAM Journal on Computing
Graph homomorphisms and phase transitions
Journal of Combinatorial Theory Series B
The complexity of counting graph homomorphisms
Proceedings of the ninth international conference on on Random structures and algorithms
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Computational Complexity
Counting H-colorings of partial k-trees
Theoretical Computer Science
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
On Counting Independent Sets in Sparse Graphs
SIAM Journal on Computing
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The rank of connection matrices and the dimension of graph algebras
European Journal of Combinatorics
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
Graphs, polymorphisms and the complexity of homomorphism problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Constraints, consistency and closure
Artificial Intelligence
The Complexity of Weighted Boolean CSP
SIAM Journal on Computing
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Holographic algorithms: From art to science
Journal of Computer and System Sciences
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
The Counting Constraint Satisfaction Problem (#CSP(H)) over a finite relational structure H can be expressed as follows: given a relational structure G over the same vocabulary, determine the number of homomorphisms from G to H. In this article we characterize relational structures H for which (#CSP(H) can be solved in polynomial time and prove that for all other structures the problem is #P-complete.