No. Title Author Year
1 Computational Complexity and Partition Functions (Invited Talk) Goldberg, Leslie Ann 2019
2 Fast Algorithms at Low Temperatures via Markov Chains Chen, Zongchen et al. 2019
3 The Complexity of Approximating the Matching Polynomial in the Complex Plane Bezáková, Ivona et al. 2019
4 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
5 Computational Counting (Dagstuhl Seminar 18341) Bezáková, Ivona et al. 2018
6 Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs Blanca, Antonio et al. 2018
7 Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems Galanis, Andreas et al. 2017
8 Inapproximability of the Independent Set Polynomial Below the Shearer Threshold Galanis, Andreas et al. 2017
9 A Complexity Trichotomy for Approximately Counting List H-Colourings Galanis, Andreas et al. 2016
10 Amplifiers for the Moran Process Galanis, Andreas et al. 2016
Current Page :
Number of result pages: 3
Number of documents: 22

DROPS-Home | Imprint | Privacy Published by LZI