| No. | Title | Author | Year |
|---|---|---|---|
| 1 | The complexity of approximating conservative counting CSPs | Chen, Xi et al. | 2013 |
| 2 | The #CSP Dichotomy is Decidable | Dyer, Martin et al. | 2011 |
| 3 | The Complexity of Approximating Bounded-Degree Boolean #CSP | Dyer, Martin et al. | 2010 |
| Number of result pages: | 1 |
| Number of documents: | 3 |
