No. Title Author Year
1 Counting Homomorphisms to Cactus Graphs Modulo 2 Göbel, Andreas et al. 2014
2 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
3 The #CSP Dichotomy is Decidable Dyer, Martin et al. 2011
4 The Complexity of Approximating Bounded-Degree Boolean #CSP Dyer, Martin et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 4


DROPS-Home | Fulltext Search | Imprint Published by LZI