An approximation trichotomy for Boolean #CSP

@article{Dyer2010AnAT,
  title={An approximation trichotomy for Boolean #CSP},
  author={Martin E. Dyer and Leslie Ann Goldberg and Mark Jerrum},
  journal={J. Comput. Syst. Sci.},
  year={2010},
  volume={76},
  pages={267-277}
}
We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a constraint language specifying the relations that may be used in constraints. If every relation in the constraint language is affine then the number of satisfying assignments can be exactly counted in polynomial time. Otherwise, if every relation in the constraint language is in the co-clone IM 2 from Post's lattice, then… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

Counting Problems and Clones of Functions

2009 39th International Symposium on Multiple-Valued Logic • 2009
View 5 Excerpts
Highly Influenced

The trichotomy of HAVING queries on a probabilistic database

The VLDB Journal • 2009
View 6 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-5 of 5 references

The complexity of partition functions

M. Grohe
Theoretical Computer Science • 2005

Complexity of generalized satisfiability counting problems

M. Hermann
Information and Computation • 1996

Similar Papers

Loading similar papers…