Towards NP–P via proof complexity and search
Author:
Publisher
Elsevier BV
Subject
Logic
Reference113 articles.
1. M. Ajtai, The complexity of the pigeonhole principle, in: Proceedings of the 29-th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 346–355.
2. M. Ajtai, The independence of the modulo p counting principles, in: Proceedings of the 26th Annual ACM Symposiom on Theory of Computing, Association for Computing Machinery, 1994, pp. 402–411.
3. M. Alekhnovich, E. Ben-Sasson, A. Razborov, A. Widgerson, Pseudorandom generators in propositional proof complexity, in: Proc. 41st IEEE Conf. on Foundations of Computer Science, FOCS, 2000, pp. 43–53.
4. Minimum propositional proof length is NP-hard to linearly approximate;Alekhnovich;Journal of Symbolic Logic,2001
5. M. Alekhnovich, J. Johannsen, T. Pitassi, A. Urquhart, An exponential separation between regular and general resolution, in: Proc. 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 448–456.
Cited by 62 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hard QBFs for Merge Resolution;ACM Transactions on Computation Theory;2023-12-22
2. Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution;Logical Methods in Computer Science;2023-04-14
3. Hardness Characterisations and Size-width Lower Bounds for QBF Resolution;ACM Transactions on Computational Logic;2023-01-27
4. Justification as ignorance and logical omniscience;Asian Journal of Philosophy;2022-02-16
5. Proof Complexity of Monotone Branching Programs;Revolutions and Revelations in Computability;2022
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3