No. |
Title |
Author |
Year |
---|

1 |
Computational Complexity and Partition Functions |
Goldberg, Leslie Ann |
2019 |

2 |
A Fixed-Parameter Perspective on #BIS |
Curticapean, Radu et al. |
2018 |

3 |
Computational Counting (Dagstuhl Seminar 18341) |
Bezáková, Ivona et al. |
2018 |

4 |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs |
Blanca, Antonio et al. |
2018 |

5 |
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems |
Galanis, Andreas et al. |
2017 |

6 |
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold |
Galanis, Andreas et al. |
2017 |

7 |
A Complexity Trichotomy for Approximately Counting List H-Colourings |
Galanis, Andreas et al. |
2016 |

8 |
Amplifiers for the Moran Process |
Galanis, Andreas et al. |
2016 |

9 |
Approximation via Correlation Decay When Strong Spatial Mixing Fails |
Bezáková, Ivona et al. |
2016 |

10 |
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region |
Cai, Jin-Yi et al. |
2014 |