arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1310.2252cond-mat.stat-mech
收藏

统计力学的Kramers-Wannier对偶在布尔可满足性问题中的应用

Kramers-Wannier Duality of Statistical Mechanics Applied to the Boolean Satisfiability Problem of Computer Science

Joe Mitchell, Benjamin Hsu, Victor Galitski

摘要:

我们提出了一个新的应用Kramers-Wannier对偶的计算机科学中最重要的问题之一,布尔可满足性问题(SAT)。更具体地说,我们专注于sharp-SAT或等价的#SAT -计算布尔满意度公式的解决方案的数量的问题。#SAT可以转换成一种物理力学语言,在那里它简化为计算具有多自旋相互作用的伊辛自旋哈密顿量的配分函数。我们表明,Kramers-Wannier对偶可以推广到适用于这样的多连接自旋网络。我们提出了一个确切的对偶伙伴#SAT和明确验证他们的等价性与一些简单的例子。它表明,NP-完全性的原始问题的地图上的复杂性的对偶问题的计数的非负解的数量丢番图方程组。我们讨论了这种对偶性的影响和应用到计算机科学问题的类似对偶性的前景。

英文摘要:

We present a novel application of the Kramers-Wannier duality on one of the most important problems of computer science, the Boolean satisfiability problem (SAT). More specifically, we focus on sharp-SAT or equivalently #SAT - the problem of counting the number of solutions to a Boolean satisfaction formula. #SAT can be cast into a statistical-mechanical language, where it reduces to calculating the partition function of an Ising spin Hamiltonian with multi-spin interactions. We show that Kramers-Wannier duality can be generalized to apply to such multi-connected spin networks. We present an exact dual partner to #SAT and explicitly verify their equivalence with a few simple examples. It is shown that the NP-completeness of the original problem maps on the complexity of the dual problem of enumerating the number of non-negative solutions to a Diophantine system of equations. We discuss the implications of this duality and the prospects of similar dualities applied to computer science problems.

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

↑