| No. | Title | Author | Year |
|---|---|---|---|
| 1 | The complexity of approximating conservative counting CSPs | Chen, Xi et al. | 2013 |
| 2 | Log-supermodular functions, functional clones and counting CSPs | Bulatov, Andrei A. et al. | 2012 |
| 3 | Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) | Dyer, Martin et al. | 2011 |
| 4 | The #CSP Dichotomy is Decidable | Dyer, Martin et al. | 2011 |
| 5 | The Complexity of Approximating Bounded-Degree Boolean #CSP | Dyer, Martin et al. | 2010 |
| 6 | 08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms | Dyer, Martin E. et al. | 2008 |
| 7 | 05201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms | Dyer, Martin et al. | 2005 |
| Number of result pages: | 1 |
| Number of documents: | 7 |
