# On the complexity of #CSP

@inproceedings{Dyer2010OnTC, title={On the complexity of #CSP}, author={Martin E. Dyer and David Richerby}, booktitle={STOC}, year={2010} }

- Published in STOC 2010
DOI:10.1145/1806689.1806789

Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem, #CSP. A problem from #CSP is characterized by a constraint language γ, which is a fixed, finite set of relations over a finite domain. An instance of the problem uses these relations to constrain the values taken by a finite set of variables. Bulatov showed that, for any fixed γ, the problem of counting the satisfying assignments of instances of any problem from #CSP is either in polynomial time (FP) or #P… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 26 CITATIONS

## The computational complexity of approximation of partition functions

VIEW 4 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Guest column: complexity dichotomies of counting problems

VIEW 24 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Holographic algorithm with matchgates is universal for planar #CSP over boolean domain

VIEW 6 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## The complexity of weighted and unweighted #CSP

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights

VIEW 3 EXCERPTS

CITES BACKGROUND & RESULTS

## Dichotomy for Real Holant$^c$ Problems

VIEW 1 EXCERPT

CITES BACKGROUND

## The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights

VIEW 1 EXCERPT

CITES BACKGROUND

## Advances in the Computational Complexity of Holant Problems

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES

## A Simple Algorithm for Mal'tsev Constraints

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem

VIEW 12 EXCERPTS

HIGHLY INFLUENTIAL

## The complexity of counting graph homomorphisms

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## On the Structure of Polynomial Time Reducibility

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## The Complexity of Partition Functions

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL