Inapproximability of counting independent sets in linear hypergraphs
Open Access
- 29 September 2023
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 184
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Research Council
- University of Edinburgh
- Horizon 2020 (947778)
- Horizon 2020
This publication has 10 references indexed in Scilit:
- Inapproximability of Counting Hypergraph ColouringsACM Transactions on Computation Theory, 2022
- Approximation via Correlation Decay When Strong Spatial Mixing FailsSIAM Journal on Computing, 2019
- Rapid mixing of hypergraph independent setsRandom Structures & Algorithms, 2018
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core ModelsCombinatorics, Probability and Computing, 2016
- Counting in two-spin models on d-regular graphsThe Annals of Probability, 2014
- A constructive proof of the general lovász local lemmaJournal of the ACM, 2010
- Adaptive simulated annealing: A near-optimal connection between sampling and countingJournal of the ACM, 2009
- Path coupling using stopping times and counting independent sets and colorings in hypergraphsRandom Structures & Algorithms, 2008
- Fast mixing for independent sets, colorings, and other models on treesRandom Structures & Algorithms, 2006
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986