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


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