Author:
Bezáková Ivona,Galanis Andreas,Goldberg Leslie Ann,Guo Heng,Štefankovič Daniel
Funder
FP7 Ideas: European Research Council
National Science Foundation
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
12 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. Inapproximability of Counting Hypergraph Colourings;ACM Transactions on Computation Theory;2022-12-31
5. Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10