No. Title Author Year
1 Counting Homomorphisms to Cactus Graphs Modulo 2 Göbel, Andreas et al. 2014
2 Computational Counting (Dagstuhl Seminar 13031) Bürgisser, Peter et al. 2013
3 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
4 Log-supermodular functions, functional clones and counting CSPs Bulatov, Andrei A. et al. 2012
5 10481 Abstracts Collection -- Computational Counting Bürgisser, Peter et al. 2011
6 10481 Executive Summary -- Computational Counting Bürgisser, Peter et al. 2011
7 Stabilizing Consensus with the Power of Two Choices Doerr, Benjamin et al. 2010
8 The Complexity of Approximating Bounded-Degree Boolean #CSP Dyer, Martin et al. 2010
9 A Complexity Dichotomy for Partition Functions with Mixed Signs Goldberg, Leslie Ann et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint Published by LZI