arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.3127cs.DMcs.CCmath.CO
收藏

k-DNF分解的极小不可满足性与时空权衡

On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution

Jakob Nordström, Alexander Razborov

摘要:

在证明k-DNF归结中证明空间的下界的背景下,[Ben-Sasson and Nordstrom 2009]引入了k-DNF公式的极小不可满足集的概念,并证明了具有m个公式的极小不可满足k-DNF集最多可以有O((n)^(k+1))个变量。他们还给出了一个带有Omega(mk^2)变量的集合的例子。在本文中,我们将下界显著改进为Omega(m)^k,其几乎与上面的上界匹配。此外,我们表明,这意味着他们的技术证明时空分离和权衡k-DNF分辨率的分析几乎是紧密的。这意味着,尽管有可能,甚至是合理的,比[Ben-Sasson and Nordstrom 2009]更强的结果应该成立,但需要一种根本不同的方法来获得这样的结果。

英文摘要:

In the context of proving lower bounds on proof space in k-DNF resolution, [Ben-Sasson and Nordstrom 2009] introduced the concept of minimally unsatisfiable sets of k-DNF formulas and proved that a minimally unsatisfiable k-DNF set with m formulas can have at most O((mk)^(k+1)) variables. They also gave an example of such sets with Omega(mk^2) variables. In this paper we significantly improve the lower bound to Omega(m)^k, which almost matches the upper bound above. Furthermore, we show that this implies that the analysis of their technique for proving time-space separations and trade-offs for k-DNF resolution is almost tight. This means that although it is possible, or even plausible, that stronger results than in [Ben-Sasson and Nordstrom 2009] should hold, a fundamentally different approach would be needed to obtain such results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑