The Complexity of the Counting Constraint Satisfaction Problem

Authors:
Andrei A. Bulatov
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, Canada
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 23

Holant problems and counting CSP

Proceedings of the forty-first annual ACM symposium on Theory of computing
The complexity of weighted Boolean #CSP with mixed signs

Theoretical Computer Science
An approximation trichotomy for Boolean #CSP

Journal of Computer and System Sciences
On the complexity of #CSP

Proceedings of the forty-second ACM symposium on Theory of computing
Holographic reduction: a domain changed application and its partial converse theorems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A Complexity Dichotomy for Partition Functions with Mixed Signs

SIAM Journal on Computing
Progress in complexity of counting problems

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
The complexity of symmetric Boolean parity Holant problems

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Spin systems on graphs with complex edge functions and specified degree regularities

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Guest column: complexity dichotomies of counting problems

ACM SIGACT News
Computational Complexity of Holant Problems

SIAM Journal on Computing
Gadgets and anti-gadgets leading to a complexity dichotomy

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximate counting via correlation decay in spin systems

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Enumerating homomorphisms

Journal of Computer and System Sciences
The complexity of weighted and unweighted #CSP

Journal of Computer and System Sciences
Dichotomy for Holant problems of Boolean domain

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Complexity of counting CSP with complex weights

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Meditations on quantified constraint satisfaction

Logic and Program Semantics
Spin systems on k-regular graphs with complex edge functions

Theoretical Computer Science
The complexity of approximating bounded-degree Boolean #CSP

Information and Computation
A complete dichotomy rises from the capture of vanishing signatures: extended abstract

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of complex weighted Boolean #CSP

Journal of Computer and System Sciences
The complexity of weighted counting for acyclic conjunctive queries

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Counting Constraint Satisfaction Problem (${\rm \#CSP}(\mathcal{H})$) over a finite relational structure $\mathcal{H}$ can be expressed as follows: given a relational structure $\mathcal{G}$ over the same vocabulary, determine the number of homomorphisms from $\mathcal{G}$ to $\mathcal{H}$. In this paper we characterize relational structures $\mathcal{H}$ for which ${\rm \#CSP}(\mathcal{H})$ can be solved in polynomial time and prove that for all other structures the problem is #P-complete.