No. Title Author Year
1 Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems Galanis, Andreas et al. 2017
2 Inapproximability of the Independent Set Polynomial Below the Shearer Threshold Galanis, Andreas et al. 2017
3 A Complexity Trichotomy for Approximately Counting List H-Colourings Galanis, Andreas et al. 2016
4 Amplifiers for the Moran Process Galanis, Andreas et al. 2016
5 Approximation via Correlation Decay When Strong Spatial Mixing Fails Bezáková, Ivona 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 Absorption Time of the Moran Process Díaz, Josep et al. 2014
8 Counting Homomorphisms to Cactus Graphs Modulo 2 Göbel, Andreas et al. 2014
9 Computational Counting (Dagstuhl Seminar 13031) Bürgisser, Peter et al. 2013
10 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 16


DROPS-Home | Fulltext Search | Imprint Published by LZI