从小空间到小宽度的分辨率
From Small Space to Small Width in Resolution
摘要:
在2003年,Atserias和Dalmau解决了一个关于归结证明系统的主要开放问题,建立了CNF公式的空间复杂度总是反驳它们所需宽度的上限。他们的证明很漂亮,但有点神秘,因为它严重依赖于有限模型理论的工具。我们给出了一个替代的,完全初等的证明,通过简单的句法操作的决议反驳。作为一个副产品,我们开发了一个“黑盒子”技术,通过一个“静态”的复杂性措施,对任何决议反驳工作证明空间下界-以前的技术已经固有的自适应。我们的结论是,多项式演算的相关问题(即,空间是否是度的上界)似乎不太可能通过类似的方法来解决。
英文摘要:
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of CNF formulas is always an upper bound on the width needed to refute them. Their proof is beautiful but somewhat mysterious in that it relies heavily on tools from finite model theory. We give an alternative, completely elementary proof that works by simple syntactic manipulations of resolution refutations. As a by-product, we develop a "black-box" technique for proving space lower bounds via a "static" complexity measure that works against any resolution refutation---previous techniques have been inherently adaptive. We conclude by showing that the related question for polynomial calculus (i.e., whether space is an upper bound on degree) seems unlikely to be resolvable by similar methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。