The Complexity of Weighted Boolean #CSP

@article{Dyer2008TheCO,
  title={The Complexity of Weighted Boolean #CSP},
  author={Martin E. Dyer and Leslie Ann Goldberg and Mark Jerrum},
  journal={SIAM J. Comput.},
  year={2008},
  volume={38},
  pages={1970-1986}
}
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterized by a finite set F of nonnegative functions that may be used to assign weights to the configurations (feasible solutions) of a problem instance. Classical constraint satisfaction problems correspond to the special case of 0,1-valued functions. We show that computing the partition function, i.e., the sum of… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 63 CITATIONS, ESTIMATED 52% COVERAGE

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

VIEW 7 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

The complexity of complex weighted Boolean #CSP

  • J. Comput. Syst. Sci.
  • 2014
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems

  • Theory of Computing Systems
  • 2013
VIEW 13 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Dichotomy for Holant* Problems of Boolean Domain

VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Guest column: complexity dichotomies of counting problems

  • SIGACT News
  • 2011
VIEW 18 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Holant problems and counting CSP

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2007
2019

CITATION STATISTICS

  • 14 Highly Influenced Citations

  • Averaged 4 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

The Complexity of Partition Functions

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of satisfiability problems

T. Schaefer
  • Proceedings of the 10th Annual ACM Symposium on Theory of Computing, ACM Press, New York
  • 1978
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

P

F. Rossi
  • van Beek, and T. Walsh, eds., Handbook of Constraint Programming, Elsevier, New York
  • 2006

Graphs and homomorphisms

  • Oxford lecture series in mathematics and its applications
  • 2004
VIEW 1 EXCERPT