37 citations · 171 across the 30 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CC2021
Inapproximability of counting hypergraph colourings
Andreas Galanis, Heng Guo, Jiaheng Wang
Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction…
cs.CC2021
Counting vertices of integral polytopes defined by facets
Heng Guo, Mark Jerrum
We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes…
cs.DS2021★ 7 cited
Local-to-Global Contraction in Simplicial Complexes
Heng Guo, Giorgos Mousa
We give a local-to-global principle for relative entropy contraction in simplicial complexes. This is similar to the local-to-global principle for variances obtained by Alev and La…