37 citations · 171 across the 30 of their papers we have counts for
4 papers · 1 filter
Counting hypergraph colorings in the local lemma regime
Heng Guo, Chao Liao, Pinyan Lu +1
We give a fully polynomial-time approximation scheme (FPTAS) to count the number of -colorings for -uniform hypergraphs with maximum degree if and $q >357Δ^{\fr…
A polynomial-time approximation algorithm for all-terminal network reliability
Heng Guo, Mark Jerrum
We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is to determine the probability that, in a undirecte…
Clifford Gates in the Holant Framework
Jin-Yi Cai, Heng Guo, Tyson Williams
We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a…
Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond
Heng Guo, Kaan Kara, Ce Zhang
For Markov chain Monte Carlo methods, one of the greatest discrepancies between theory and system is the scan order - while most theoretical development on the mixing time analysis…