Short Proofs Are Hard to Find
Short Proofs Are Hard to Find
复制标题
简短的证明很难找到
DOI：
10.4230/lipics.icalp.2019.84
复制
发表时间：
2019
影响因子：
10.6
通讯作者：
Yuanhao Wei
中科院分区：
文献类型：
--
作者：
Ian Mertz;T. Pitassi;Yuanhao Wei
12我们得到了Alekhnovich和Razborov [2]的一个重要结果的简化证明，表明树型和一般归结都很难自动化。在与[2]不同的假设下，我们的简化证明给出了改进的界限：我们在ETH下证明了这些证明系统在时间15 nf（n）上是不可自动化的，只要f（n）= o（log 1/7− logn），对于任何> 0。以前的非自动化性只知道16 f（n）= O（1）。我们的证明也相当直接地扩展到证明PCR和17 Res（r）的类似硬度结果。18 2012 ACM主题分类计算理论→证明复杂性;硬件→定理19证明和SAT解决20
12 We obtain a streamlined proof of an important result by Alekhnovich and Razborov [2], showing that it is 13 hard to automatize both tree-like and general Resolution. Under a different assumption than [2], our simplified 14 proof gives improved bounds: we show under ETH that these proof systems are not automatizable in time 15 nf(n), whenever f(n) = o(log1/7− logn) for any > 0. Previously non-automatizability was only known for 16 f(n) = O(1). Our proof also extends fairly straightforwardly to prove similar hardness results for PCR and 17 Res(r). 18 2012 ACM Subject Classification Theory of computation→ Proof complexity; Hardware→ Theorem 19 proving and SAT solving 20
BPP 的查询到通信提升
影响因子：
1.6
作者：
Göös, Mika;Pitassi, Toniann;Watson, Thomas
通讯作者：
Watson, Thomas