536 citations · 1.7k across the 16 of their papers we have counts for
Showing cs.CCShow all
2 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.CC2019
On the Degree of Boolean Functions as Polynomials over
Xiaoming Sun, Yuan Sun, Jiaheng Wang +3
Polynomial representations of Boolean functions over various rings such as and have been studied since Minsky and Papert (1969). From then on, they have…