Path coupling using stopping times and counting independent sets and colorings in hypergraphs-Reference-Cited by-同舟云学术

Path coupling using stopping times and counting independent sets and colorings in hypergraphs

Published:2008 Issue:3 Volume:32 Page:375-399
ISSN:1042-9832
Container-title:Random Structures and Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Bordewich Magnus,Dyer Martin,Karpinski Marek

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference29 articles.

1. “Random walks on finite groups and rapidly mixing Markov chains,” Séminaire de Probabilités XVII 1981/1982, vol. 986 of Springer-Verlag Lecture Notes in Mathematics and (Editors), Springer-Verlag, New York, 1983, pp. 243–297.

2. Randomized algorithms: Approximation, generation and counting, Springer-Verlag, London, 2001.

3. , Graph orientations with no sink and an approximation for a hard case of #SAT, Proc 8th ACM-SIAM Symp Discrete Algorithms (SODA), SIAM, New Orleans, LA, 1997, pp. 248–257.

4. , The complexity of partition functions, Proc 31st ICALP 2004, Springer, Turku, Finland, 2004, pp. 294–306.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inapproximability of counting independent sets in linear hypergraphs;Information Processing Letters;2024-02

2. Towards derandomising Markov chain Monte Carlo;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. On the zeroes of hypergraph independence polynomials;Combinatorics, Probability and Computing;2023-09-21

4. Sampling constraint satisfaction solutions in the local lemma regime;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

5. Counting hypergraph matchings up to uniqueness threshold;Information and Computation;2019-06