No. Title Author Year
1 Counting Solutions to Random CNF Formulas Galanis, Andreas et al. 2020
2 Fast Algorithms for General Spin Systems on Bipartite Expanders Galanis, Andreas et al. 2020
3 The Complexity of Approximating the Complex-Valued Potts Model Galanis, Andreas et al. 2020
4 Fast Algorithms at Low Temperatures via Markov Chains Chen, Zongchen et al. 2019
5 Improved Strong Spatial Mixing for Colorings on Trees Efthymiou, Charilaos et al. 2019
6 The Complexity of Approximating the Matching Polynomial in the Complex Plane Bezáková, Ivona et al. 2019
7 Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs Blanca, Antonio et al. 2018
8 Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems Galanis, Andreas et al. 2017
9 Inapproximability of the Independent Set Polynomial Below the Shearer Threshold Galanis, Andreas et al. 2017
10 A Complexity Trichotomy for Approximately Counting List H-Colourings Galanis, Andreas et al. 2016
11 Amplifiers for the Moran Process Galanis, Andreas et al. 2016
12 Approximation via Correlation Decay When Strong Spatial Mixing Fails Bezáková, Ivona et al. 2016
13 Swendsen-Wang Algorithm on the Mean-Field Potts Model Galanis, Andreas et al. 2015
14 #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region Cai, Jin-Yi et al. 2014
15 Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results Galanis, Andreas et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 15


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI