No. Title Author Year
1 #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region Cai, Jin-Yi 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 A Complexity Dichotomy for Partition Functions with Mixed Signs Goldberg, Leslie Ann et al. 2009
8 08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms Dyer, Martin E. et al. 2008
9 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: 9


DROPS-Home | Fulltext Search | Imprint Published by LZI