No. Title Author Year
1 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
2 Computational Counting (Dagstuhl Seminar 18341) Bezáková, Ivona et al. 2018
3 Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems Galanis, Andreas et al. 2017
4 Inapproximability of the Independent Set Polynomial Below the Shearer Threshold Galanis, Andreas et al. 2017
5 A Complexity Trichotomy for Approximately Counting List H-Colourings Galanis, Andreas et al. 2016
6 Amplifiers for the Moran Process Galanis, Andreas et al. 2016
7 Approximation via Correlation Decay When Strong Spatial Mixing Fails Bezáková, Ivona et al. 2016
8 #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region Cai, Jin-Yi et al. 2014
9 Absorption Time of the Moran Process Díaz, Josep et al. 2014
10 Counting Homomorphisms to Cactus Graphs Modulo 2 Göbel, Andreas et al. 2014
Current Page :
Number of result pages: 2
Number of documents: 18


DROPS-Home | Fulltext Search | Imprint Published by LZI