.png){kind=icon}
返回
Bose-Einstein condensation in satisfiability problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2012.11.039.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper is concerned with the complex behavior arising in satisfiability problems. We present a new statistical physics-based characterization of the satisfiability problem. Specifically, we design an algorithm that is able to produce graphs starting from a k-SAT instance, in order to analyze them and show whether a Bose-Einstein condensation occurs. We observe that, analogously to complex networks, the networks of k-SAT instances follow Bose statistics and can undergo Bose-Einstein condensation. In particular, k-SAT instances move from a fit-get-rich network to a winner-takes-all network as the ratio of clauses to variables decreases, and the phase transition of k-SAT approximates the critical temperature for the Bose-Einstein condensation. Finally, we employ the fitness-based classification to enhance SAT solvers (e.g., ChainSAT) and obtain the consistently highest performing SAT solver for CNF formulas, and therefore a new class of efficient hardware and software verification tools. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
k-SAT
Complex networks
Bose-Einstein condensation
Phase transition
Performance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers使用RCPSP和SAT求解器的多模式资源受限项目调度OAAI
.png){kind=icon}
OAAI分享收藏A tabu search approach to the constraint satisfaction problem as a general problem solver作为一般问题解决者的约束满足问题的禁忌搜索方法
PREAI
分享收藏分享收藏Molecular identification of white morphotype strains of endophytic fungi from Pinus tabulaeformis
PREAI
分享收藏
查看更多内容