Research output per year
Research output per year
- 12 results
Search results
-
2023
Inapproximability of Counting Independent Sets in Linear Hypergraphs
Qiu, G. & Wang, J., 10 Oct 2023, In: Information Processing Letters. 184, February 2024, p. 1-6 6 p., 106448.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Counting vertices of integral polytopes defined by facets
Guo, H. & Jerrum, M., 1 Oct 2023, In: Discrete & computational geometry. 70, 3, p. 975-990 16 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
Feng, W., Guo, H. & Wang, J., 12 Jul 2023, In: Information and Computation. 294, p. 1-34 105066.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
Feng, W., Guo, H., Jerrum, M. & Wang, J., 12 Jun 2023, In: TheoretiCS. 2, p. 1-7 8.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Inapproximability of counting hypergraph colourings
Galanis, A., Guo, H. & Wang, J., 1 Feb 2023, In: ACM Transactions on Computation Theory. 14, 3-4, 33 p., 10.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2022
Perfect sampling from spatial mixing
Feng, W., Guo, H. & Yin, Y., 1 Dec 2022, In: Random Structures and Algorithms. 61, 4, p. 678-709 32 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Rapid Mixing from Spectral Independence beyond the Boolean Domain
Feng, W., Guo, H., Yin, Y. & Zhang, C., 11 Oct 2022, In: ACM Transactions on Algorithms. 18, 3, 33 p., 28.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Improved bounds for randomly colouring simple hypergraphs
Feng, W., Guo, H. & Wang, J., 15 Sept 2022, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Chakrabarti, A. & Swamy, C. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 245. p. 1-17 25. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 245).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
FKT is not universal — A planar Holant dichotomy for symmetric constraints
Cai, J-Y., Fu, Z., Guo, H. & Williams, T., 1 Feb 2022, In: Theory of Computing Systems. 66, p. 143-308 166 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2021
Fast sampling and counting k-SAT solutions in the local lemma regime
Feng, W., Guo, H., Yin, Y. & Zhang, C., 1 Dec 2021, In: Journal of the ACM. 68, 6, 42 p., 40.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Counting Solutions to Random CNF Formulas
Galanis, A., Goldberg, L. A., Guo, H. & Yang, K., 29 Nov 2021, In: SIAM Journal on Computing. 50, 6, p. 1701-1738 38 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Rapid mixing from spectral independence beyond the Boolean domain
Feng, W., Guo, H., Yin, Y. & Zhang, C., 10 Jan 2021, Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA21). ACM, p. 1558 – 1577 20 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile