Heng Guo

According to our database1, Heng Guo authored at least 37 papers between 2009 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


The complexity of planar Boolean #CSP with complex weights.
J. Comput. Syst. Sci., 2020

Zeros of ferromagnetic 2-spin systems.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability.
SIAM J. Comput., 2019

Approximation via Correlation Decay When Strong Spatial Mixing Fails.
SIAM J. Comput., 2019

Counting Hypergraph Colorings in the Local Lemma Regime.
SIAM J. Comput., 2019

Uniform Sampling Through the Lovász Local Lemma.
J. ACM, 2019

Counting solutions to random CNF formulas.
CoRR, 2019

Fast sampling and counting k-SAT solutions in the local lemma regime.
CoRR, 2019

Perfect sampling from spatial mixing.
CoRR, 2019

Zeros of Holant problems: locations and algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems.
TOCT, 2018

Clifford gates in the Holant framework.
Theor. Comput. Sci., 2018

Holographic algorithms beyond matchgates.
Inf. Comput., 2018

Approximately counting bases of bicircular matroids.
CoRR, 2018

Tight bounds for popping algorithms.
CoRR, 2018

Counting hypergraph colourings in the local lemma regime.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

A simple FPRAS for bi-directed reachability.
CoRR, 2017

The Complexity of Approximating complex-valued Ising and Tutte partition functions.
Computational Complexity, 2017

Random cluster dynamics for the Ising model is rapidly mixing.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

On the Complexity of Holant Problems.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Holant Problems.
Encyclopedia of Algorithms, 2016

A Complete Dichotomy Rises from the Capture of Vanishing Signatures.
SIAM J. Comput., 2016

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.
J. Comput. Syst. Sci., 2016

Mapping the complexity of counting problems.
Bulletin of the EATCS, 2016

A Holant Dichotomy: Is the FKT Algorithm Universal?
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation.
CoRR, 2014

The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

The Complexity of Symmetric Boolean Parity Holant Problems.
SIAM J. Comput., 2013

Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs.
CoRR, 2013

A complete dichotomy rises from the capture of vanishing signatures: extended abstract.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Inapproximability after Uniqueness Phase Transition in Two-Spin Systems.
Proceedings of the Combinatorial Optimization and Applications, 2012

The Complexity of Weighted Boolean #CSP Modulo k.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract).
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

On Model Checking Boolean BI.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009