使用关键变量改进3- SAT的PPSZ
Improving PPSZ for 3-SAT using Critical Variables
摘要:
可满足CNF公式的临界变量是在所有满足赋值中具有相同值的变量。通过对CNF公式的临界变量分数进行简单的情况区分,我们将3-SAT的运行时间从Rolf [2006]的O(1.32216^n)提高到O(1.32153^n)。使用不同的方法,Iwama等人。[2010]最近实现了O(1.32113 ^n)的运行时间。我们的方法很好地结合了他们的方法,产生了目前最快的已知算法,运行时间为O(1.32065^n)。我们还将4-SAT的界从O(1.47390^n)[Iwama,Tamaki 2004]提高到O(1.46928^n),其中O(1.46981^n)可以使用[Iwama,Tamaki 2004]和[Rolf 2006]的方法获得。
英文摘要:
A critical variable of a satisfiable CNF formula is a variable that has the same value in all satisfying assignments. Using a simple case distinction on the fraction of critical variables of a CNF formula, we improve the running time for 3-SAT from O(1.32216^n) by Rolf [2006] to O(1.32153^n). Using a different approach, Iwama et al. [2010] very recently achieved a running time of O(1.32113^n). Our method nicely combines with theirs, yielding the currently fastest known algorithm with running time O(1.32065^n). We also improve the bound for 4-SAT from O(1.47390^n) [Iwama, Tamaki 2004] to O(1.46928^n), where O(1.46981^n) can be obtained using the methods of [Iwama, Tamaki 2004] and [Rolf 2006].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。