Sampling constraint satisfaction solutions in the local lemma regime
Author:
Affiliation:
1. Nanjing University, China
2. Institute of Computing Technology at Chinese Academy of Sciences, China / University of Chinese Academy of Sciences, China
Funder
National Natural Science Foundation of China
National Key Research and Development Program of China
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3406325.3451101
Reference43 articles.
1. Random Walks That Find Perfect Objects and the Lovász Local Lemma
2. Dimitris Achlioptas Fotis Iliopoulos and Alistair Sinclair. 2019. Beyond the Lovász local lemma: Point to set correlations and their algorithmic applications. In FOCS. Pages 725–744. https://doi.org/10.1109/FOCS.2019.00049 10.1109/FOCS.2019.00049 Dimitris Achlioptas Fotis Iliopoulos and Alistair Sinclair. 2019. Beyond the Lovász local lemma: Point to set correlations and their algorithmic applications. In FOCS. Pages 725–744. https://doi.org/10.1109/FOCS.2019.00049 10.1109/FOCS.2019.00049
3. A parallel algorithmic version of the local lemma
4. An algorithmic approach to the Lovász local lemma. I
5. Approximation via Correlation Decay When Strong Spatial Mixing Fails
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Towards derandomising Markov chain Monte Carlo;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. On Exact Sampling in the Two-Variable Fragment of First-Order Logic;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Inapproximability of Counting Hypergraph Colourings;ACM Transactions on Computation Theory;2022-12-31
4. 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
5. Towards the sampling Lovász Local Lemma;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3