期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Statistical physics of hard combinatorial optimization:Vertex cover problem 被引量:1
1
作者 赵金华 周海军 《Chinese Physics B》 SCIE EI CAS CSCD 2014年第7期114-120,共7页
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 s... 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-polynomi'al (NP)-complete combinatorial opti- mization 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 the mean field methods in solving other optimization problems. 展开更多
关键词 spin glass energy minimization replica symmetry breaking belief propagation
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部