Author:
Song Renjie,Yin Yitong,Zhao Jinman
Funder
National Key R&D Program of China
National Science Foundation of China
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference34 articles.
1. Simple deterministic approximation algorithms for counting matchings;Bayati,2007
2. Counting independent sets in hypergraphs when strong spatial mixing fails;Bezakova,2016
3. Path coupling using stopping times and counting independent sets and colorings in hypergraphs;Bordewich;Random Struct. Algorithms,2008
4. Ising models on locally tree-like graphs;Dembo;Ann. Appl. Probab.,2010
5. Approximate counting of matchings in (3, 3)-hypergraphs;Dudek,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Smoothed counting of 0–1 points in polyhedra;Random Structures & Algorithms;2022-12-30
2. Perfect sampling from spatial mixing;Random Structures & Algorithms;2022-02-18