No. Title Author Year
1 Improved Bounds for Randomly Colouring Simple Hypergraphs Feng, Weiming et al. 2022
2 Counting Solutions to Random CNF Formulas Galanis, Andreas et al. 2020
3 A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability Guo, Heng et al. 2018
4 Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling Guo, Heng et al. 2018
5 On the Complexity of Holant Problems Guo, Heng et al. 2017
6 Approximation via Correlation Decay When Strong Spatial Mixing Fails Bezáková, Ivona et al. 2016
7 Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems Guo, Heng 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 The Complexity of Weighted Boolean #CSP Modulo k Guo, Heng et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 9

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