Clique is hard on average for regular resolution

Author:

Atserias Albert1,Bonacina Ilario1,de Rezende Susanna F.2,Lauria Massimo3,Nordström Jakob2,Razborov Alexander4

Affiliation:

1. Universitat Politècnica de Catalunya, Spain

2. KTH, Sweden

3. Sapienza University of Rome, Italy

4. University of Chicago, USA / Russian Academy of Sciences, Russia

Funder

FP7 Ideas: European Research Council

Vetenskapsrådet

H2020 European Research Council

Publisher

ACM

Reference44 articles.

1. Noga Alon Michael Krivelevich and Benny Sudakov. 1998. Noga Alon Michael Krivelevich and Benny Sudakov. 1998.

2. The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs

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

1. Cryptography from Planted Graphs: Security with Logarithmic-Size Messages;Theory of Cryptography;2023

2. Proof Complexity of Modal Resolution;Journal of Automated Reasoning;2021-10-13

3. Clique Is Hard on Average for Regular Resolution;Journal of the ACM;2021-06-30

4. Characterizing Tseitin-Formulas with Short Regular Resolution Refutations;Theory and Applications of Satisfiability Testing – SAT 2021;2021

5. Large Clique is Hard on Average for Resolution;Computer Science – Theory and Applications;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3