arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.2737cs.DM
收藏

一类布尔型CSP的二阶矩方法

Second moment method for a family of boolean CSP

Yacine Boufkhad, Olivier Dubois

摘要:

随机布尔约束满足问题(CSP)的相变估计基于两个基本工具:一阶矩方法和二阶矩方法。虽然一阶矩方法的解决方案的数量允许计算上界的任何布尔CSP,用于计算下界的二阶矩方法被证明是更棘手的,在大多数情况下,只给出平凡的下界0。在本文中,我们定义了布尔CSP的一个子类,覆盖了许多已知的NP完全布尔CSP的单调版本。我们给出了一个方法计算非平凡的下界的任何成员这个子类。这是由于实现了应用程序的二阶矩方法,一些选定的解决方案,称为特征的解决方案,取决于布尔CSP考虑。我们应用这种方法与更精细的分析,以建立单调1-in-k-SAT的阈值$r_{k}$(比率:#约束/#变量)是$\log k/k\leq r_{k}\leq\log^{2}k/k$。

英文摘要:

The estimation of phase transitions in random boolean Constraint Satisfaction Problems (CSP) is based on two fundamental tools: the first and second moment methods. While the first moment method on the number of solutions permits to compute upper bounds on any boolean CSP, the second moment method used for computing lower bounds proves to be more tricky and in most cases gives only the trivial lower bound 0. In this paper, we define a subclass of boolean CSP covering the monotone versions of many known NP-Complete boolean CSPs. We give a method for computing non trivial lower bounds for any member of this subclass. This is achieved thanks to an application of the second moment method to some selected solutions called characteristic solutions that depend on the boolean CSP considered. We apply this method with a finer analysis to establish that the threshold $r_{k}$ (ratio : #constrains/#variables) of monotone 1-in-k-SAT is $\log k/k\leq r_{k}\leq\log^{2}k/k$.

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

↑