No. Title Author Year
1 Counting Constraint Satisfaction Problems Jerrum, Mark 2017
2 A Complexity Trichotomy for Approximately Counting List H-Colourings Galanis, Andreas et al. 2016
3 #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region Cai, Jin-Yi et al. 2014
4 Computational Counting (Dagstuhl Seminar 13031) Bürgisser, Peter et al. 2013
5 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
6 Log-supermodular functions, functional clones and counting CSPs Bulatov, Andrei A. et al. 2012
7 10481 Abstracts Collection -- Computational Counting Bürgisser, Peter et al. 2011
8 10481 Executive Summary -- Computational Counting Bürgisser, Peter et al. 2011
9 A Complexity Dichotomy for Partition Functions with Mixed Signs Goldberg, Leslie Ann et al. 2009
10 08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms Dyer, Martin E. et al. 2008
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint Published by LZI