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.
Exact spin form factors and correlations at a massive Kramers-Wannier interface
HUN-REN Wigner Research Centre for Physics(匈牙利科学院维格纳物理研究中心);Institute of Theoretical Physics and Mark Kac Center for Complex, Systems Research, Jagiellonian University(雅盖隆大学理论物理研究所及马克·卡克复杂系统研究中心)
Crosscap states and duality of Ising field theory in two dimensions
Faculty of Physics and Arnold Sommerfeld Center for Theoretical Physics, Ludwig-Maximilians-Universität München(慕尼黑大学物理学院与阿诺德·索末菲理论物理中心);School of Physics and Wuhan National High Magnetic Field Center, Huazhong University of Science and Technology(华中科技大学物理学院与武汉国家强磁场科学中心);Institute of Physics, Chinese Academy of Sciences(中国科学院物理研究所);Songshan Lake Materials Laboratory(松山湖材料实验室)
Machine learning and optimization-based approaches to duality in statistical physics
Deutsches Elektronen-Synchrotron DESY(德国电子同步加速器研究所);School of Mathematics, The University of Edinburgh(爱丁堡大学数学学院);Max Planck Institute for Human Development(马克斯·普朗克人类发展研究所);Durham University(杜伦大学);University of Amsterdam(阿姆斯特丹大学)