| Inapproximability of counting hypergraph colourings A Galanis, H Guo, J Wang ACM Transactions on Computation Theory 14 (3-4), 1-33, 2023 | 9 | 2023 |
| Improved bounds for randomly colouring simple hypergraphs W Feng, H Guo, J Wang arXiv preprint arXiv:2202.05554, 2022 | 8 | 2022 |
| Towards derandomising markov chain monte carlo W Feng, H Guo, C Wang, J Wang, Y Yin 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 7 | 2023 |
| Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields W Feng, H Guo, J Wang arXiv preprint arXiv:2205.01985, 2022 | 7* | 2022 |
| A simple polynomial-time approximation algorithm for the total variation distance between two product distributions W Feng, H Guo, M Jerrum, J Wang TheoretiCS 2, 2023 | 6 | 2023 |
| Inapproximability of counting independent sets in linear hypergraphs G Qiu, J Wang Information Processing Letters 184, 106448, 2024 | 3 | 2024 |
| Algorithms and complexity for approximately counting hypergraph colourings and related problems J Wang The University of Edinburgh, 2024 | | 2024 |
| Approximate Counting for Spin Systems in Sub-Quadratic Time K Anand, W Feng, G Freifeld, H Guo, J Wang arXiv preprint arXiv:2306.14867, 2023 | | 2023 |
| On the Degree of Boolean Functions as Polynomials over ℤ_m X Sun, Y Sun, J Wang, K Wu, Z Xia, Y Zheng 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | | 2020 |
Heng GuoUniversity of Edinburgh在 inf.ed.ac.uk 的电子邮件经过验证
