Heng Guo
Heng Guo
Verified email at - Homepage
Cited by
Cited by
A complete dichotomy rises from the capture of vanishing signatures
JY Cai, H Guo, T Williams
SIAM Journal on Computing 45 (5), 1671-1728, 2016
Random cluster dynamics for the Ising model is rapidly mixing
H Guo, M Jerrum
Annals of Applied Probability 28 (2), 1292-1313, 2018
Uniform sampling through the Lovász local lemma
H Guo, M Jerrum, J Liu
Journal of the ACM (JACM) 66 (3), 1-31, 2019
The complexity of approximating complex-valued Ising and Tutte partition functions
LA Goldberg, H Guo
computational complexity 26 (4), 765-833, 2017
# BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
JY Cai, A Galanis, LA Goldberg, H Guo, M Jerrum, D Štefankovič, ...
Journal of Computer and System Sciences 82 (5), 690-711, 2016
The complexity of symmetric Boolean parity Holant problems
H Guo, P Lu, LG Valiant
SIAM Journal on Computing 42 (1), 324-356, 2013
Modified log-Sobolev inequalities for strongly log-concave distributions
M Cryan, H Guo, G Mousa
Annals of Probability 49 (1), 506-525, 2021
Rapid mixing from spectral independence beyond the Boolean domain
W Feng, H Guo, Y Yin, C Zhang
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
The complexity of planar Boolean# CSP with complex weights
H Guo, T Williams
Journal of Computer and System Sciences 107, 1-27, 2020
The complexity of weighted Boolean #CSP modulo k
H Guo, S Huang, P Lu, M Xia
28th International Symposium on Theoretical Aspects of Computer Science …, 2011
FKT is not universal—A planar Holant dichotomy for symmetric constraints
JY Cai, Z Fu, H Guo, T Williams
Theory of Computing Systems, 2021
A polynomial-time approximation algorithm for all-terminal network reliability
H Guo, M Jerrum
SIAM Journal on Computing 48 (3), 964–978, 2017
Approximation via correlation decay when strong spatial mixing fails
I Bezáková, A Galanis, LA Goldberg, H Guo, D Stefankovic
SIAM Journal on Computing 48 (2), 279-349, 2019
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
JY Cai, H Guo, T Williams
Research in the Mathematical Sciences 3 (1), 18, 2016
Uniqueness, spatial mixing, and approximation for ferromagnetic 2-spin systems
H Guo, P Lu
ACM Transactions on Computation Theory (TOCT) 10 (4), 17, 2018
Zeros of Holant problems: locations and algorithms
H Guo, C Liao, P Lu, C Zhang
ACM Transactions on Algorithms (TALG) 17 (1), 1-25, 2020
Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling
H Guo, M Jerrum
Annales de l’Institut Henri Poincaré D (AIHPD), 2019
Counting hypergraph colorings in the local lemma regime
H Guo, C Liao, P Lu, C Zhang
SIAM Journal on Computing 48 (4), 1397-1424, 2019
Inapproximability after uniqueness phase transition in two-spin systems
JY Cai, X Chen, H Guo, P Lu
Combinatorial Optimization and Applications, 336-347, 2012
Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime
W Feng, H Guo, Y Yin, C Zhang
Journal of the ACM (JACM) 68 (6), 1-42, 2021
The system can't perform the operation now. Try again later.
Articles 1–20