Automating algebraic proof systems is NP-hard-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Automating algebraic proof systems is NP-hard

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

de Rezende Susanna F.¹,Göös Mika²,Nordström Jakob³,Pitassi Toniann⁴,Robere Robert⁵,Sokolov Dmitry⁶

Affiliation:

1. Czech Academy of Sciences, Czechia

2. EPFL, Switzerland

3. University of Copenhagen, Denmark / Lund University, Sweden

4. University of Toronto, Canada / Institute for Advanced Study at Princeton, USA

5. McGill University, Canada

6. St. Petersburg State University, Russia / Russian Academy of Sciences, Russia

Funder

Knut och Alice Wallenbergs Stiftelse

NSF (National Science Foundation)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3406325.3451080

Reference64 articles.

1. Space Complexity in Propositional Calculus

2. Minimum propositional proof length is NP-hard to linearly approximate

3. Resolution Is Not Automatizable Unless W[P] Is Tractable

4. On the automatizability of resolution and related propositional proof systems

5. A combinatorial characterization of resolution width

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

1. Proof Complexity and the Binary Encoding of Combinatorial Principles;SIAM Journal on Computing;2024-06-24

2. KRW Composition Theorems via Lifting;computational complexity;2024-04-29

3. Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard;Procedia Computer Science;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP