No. Title Author Year
1 Fast Algorithms at Low Temperatures via Markov Chains Chen, Zongchen et al. 2019
2 Improved Strong Spatial Mixing for Colorings on Trees Efthymiou, Charilaos et al. 2019
3 The Complexity of Approximating the Matching Polynomial in the Complex Plane Bezáková, Ivona et al. 2019
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 Swendsen-Wang Algorithm on the Mean-Field Potts Model Galanis, Andreas et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Imprint | Privacy Published by LZI