窄证明可能最长
Narrow Proofs May Be Maximally Long
摘要:
我们证明了有n个变量的3-CNF公式,可以在宽度w的分辨率上被反驳,但需要大小为n^Omega(w)的分辨率证明。这表明,任何宽度为w的可反驳公式必须有大小为n^O(w)的证明的简单计数论证本质上是紧的。此外,我们的下界推广到多项式演算分辨率(PCR)和Sherali-Adams,这意味着相应的大小上界的程度和秩是紧的。然而,我们的结果并没有一直延伸到Lasserre,我们研究的公式在n和w中都有常数秩和大小多项式的证明。
英文摘要:
We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size n^O(w) is essentially tight. Moreover, our lower bound generalizes to polynomial calculus resolution (PCR) and Sherali-Adams, implying that the corresponding size upper bounds in terms of degree and rank are tight as well. Our results do not extend all the way to Lasserre, however, where the formulas we study have proofs of constant rank and size polynomial in both n and w.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。