Jiaheng Wang

According to our database, Jiaheng Wang authored at least 10 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Inapproximability of counting independent sets in linear hypergraphs.

Guoliang Qiu, Jiaheng Wang

Inf. Process. Lett., February, 2024

2023

Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields.

Weiming Feng, Heng Guo, Jiaheng Wang

Inf. Comput., October, 2023

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions.

Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang

TheoretiCS, 2023

Approximate Counting for Spin Systems in Sub-Quadratic Time.

Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang

CoRR, 2023

Towards derandomising Markov chain Monte Carlo.

Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Inapproximability of Counting Hypergraph Colourings.

Andreas Galanis, Heng Guo, Jiaheng Wang

ACM Trans. Comput. Theory, December, 2022

A simple polynomial-time approximation algorithm for total variation distances between product distributions.

Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang

CoRR, 2022

Sampling from the ferromagnetic Ising model with external fields.

Weiming Feng, Heng Guo, Jiaheng Wang

CoRR, 2022

Improved Bounds for Randomly Colouring Simple Hypergraphs.

Weiming Feng, Heng Guo, Jiaheng Wang

Proceedings of the Approximation, 2022

2020

On the Degree of Boolean Functions as Polynomials over ℤ_m.

Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020