Kuan Yang
Kuan Yang
Verified email at - Homepage
Cited by
Cited by
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
A Blanca, A Galanis, LA Goldberg, D Stefankovic, E Vigoda, K Yang
SIAM Journal on Discrete Mathematics 34 (1), 742-793, 2020
Counting solutions to random CNF formulas
A Galanis, LA Goldberg, H Guo, K Yang
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
An FPTAS for counting proper four-colorings on cubic graphs
P Lu, K Yang, C Zhang, M Zhu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Improved bounds for sampling solutions of random CNF formulas
K He, K Wu, K Yang
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
FPTAS for hardcore and Ising models on hypergraphs
P Lu, K Yang, C Zhang
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) 47 …, 2016
Uniqueness for the 3-state antiferromagnetic Potts model on the tree
A Galanis, LA Goldberg, K Yang
Graph metric with no proper inclusion between lines
X Chen, G Huzhang, P Miao, K Yang
Discrete Applied Mathematics 185, 59-70, 2015
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
A Galanis, LA Goldberg, K Yang
Journal of computer and system sciences 115, 187-213, 2021
Power law decay at criticality for the q-state antiferromagnetic Potts model on regular trees
C Gu, W Wu, K Yang
arXiv preprint arXiv:2112.00573, 2021
Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees
Y Tao, S Wang, K Yang
International Workshop on Frontiers in Algorithmics, 160-170, 2023
Uniqueness for the q-state antiferromagnetic Potts model on the regular tree.
C Gu, W Wu, K Yang
CoRR, 2021
Approximation algorithms and inapproximability of partition functions of spin systems
K Yang
University of Oxford, 2019
The system can't perform the operation now. Try again later.
Articles 1–12