硬组合优化的统计物理学:顶点覆盖问题
Statistical physics of hard combinatorial optimization: The vertex cover problem
摘要:
典型情况的计算复杂性是计算机科学、应用数学和统计物理学边缘的研究课题。在过去的二十年里,自旋玻璃的复制对称破缺平均场论和相关的消息传递算法极大地加深了我们对典型情况计算复杂性的理解。本文以顶点覆盖问题这一应用广泛的NP完全组合优化问题为例,介绍了统计物理方法和算法。我们不深入技术细节,而主要强调消息传递方程的直观物理意义。一个不熟悉的读者应该能够在很大程度上理解平均场方法背后的物理原理,并在解决其他优化问题时调整它们。
英文摘要:
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust them in solving other optimization problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。