arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0609101cs.CCcond-mat.stat-mech
收藏

罕见的SAT配方是否容易识别?关于K-SAT在大子句变量比下的消息传递算法的效率

Can rare SAT formulas be easily recognized? On the efficiency of message passing algorithms for K-SAT at large clause-to-variable ratios

Fabrizio Altarelli, Remi Monasson, Francesco Zamponi

摘要:

对于大的子句变量比,从均匀分布中提取的典型K-SAT实例没有解决方案。我们认为,统计力学计算的基础上使用的副本和腔的方法,罕见的可满足的情况下,从均匀分布是非常相似的典型的情况下,从所谓的种植分布,其中的实例之间的选择,承认一个给定的解决方案均匀。然后,从Feige,Mossel和Vilenchik最近的一篇文章中可以看出,这些罕见的实例可以通过简单的消息传递算法轻松识别(在O(log N)时间内,概率接近1)。

英文摘要:

For large clause-to-variable ratio, typical K-SAT instances drawn from the uniform distribution have no solution. We argue, based on statistical mechanics calculations using the replica and cavity methods, that rare satisfiable instances from the uniform distribution are very similar to typical instances drawn from the so-called planted distribution, where instances are chosen uniformly between the ones that admit a given solution. It then follows, from a recent article by Feige, Mossel and Vilenchik, that these rare instances can be easily recognized (in O(log N) time and with probability close to 1) by a simple message-passing algorithm.

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

↑