Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem

@inproceedings{Bulatov2003TowardsAD,
  title={Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem},
  author={Andrei A. Bulatov and V{\'i}ctor Dalmau},
  booktitle={FOCS},
  year={2003}
}
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 104 CITATIONS, ESTIMATED 35% COVERAGE

The complexity of the counting constraint satisfaction problem

VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Guest column: complexity dichotomies of counting problems

  • SIGACT News
  • 2011
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the complexity of #CSP

VIEW 12 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

The Complexity of Weighted Boolean #CSP

VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Complexity Dichotomies for CSP-related Problems

VIEW 5 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

The complexity of partition functions

  • Theor. Comput. Sci.
  • 2005
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Counting 4×4 matrix partitions of graphs

  • Discrete Applied Mathematics
  • 2016
VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Holographic reduction, interpolation and hardness

  • computational complexity
  • 2012
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Interpolation and Hardness

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2003
2019

CITATION STATISTICS

  • 12 Highly Influenced Citations

  • Averaged 6 Citations per year over the last 3 years

Similar Papers

Loading similar papers…