| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Computational Counting (Dagstuhl Seminar 13031) | Bürgisser, Peter et al. | 2013 |
| 2 | The complexity of approximating conservative counting CSPs | Chen, Xi et al. | 2013 |
| 3 | Log-supermodular functions, functional clones and counting CSPs | Bulatov, Andrei A. et al. | 2012 |
| 4 | 10481 Abstracts Collection -- Computational Counting | Bürgisser, Peter et al. | 2011 |
| 5 | 10481 Executive Summary -- Computational Counting | Bürgisser, Peter et al. | 2011 |
| 6 | A Complexity Dichotomy for Partition Functions with Mixed Signs | Goldberg, Leslie Ann et al. | 2009 |
| 7 | 08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms | Dyer, Martin E. et al. | 2008 |
| 8 | 05201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms | Dyer, Martin et al. | 2005 |
| Number of result pages: | 1 |
| Number of documents: | 8 |
