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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI