arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0005032cs.CCcs.DS
收藏

计算复杂性与相变

Computational Complexity and Phase Transitions

Gabriel Istrate

摘要:

最近已被证明是有用的组合问题中的相变定位“硬”的组合问题的实例。计算复杂性和相变的存在之间的联系已经在统计力学和人工智能中得到了解决,但没有严格研究。我们采取了一个步骤,在这个方向上,通过调查的存在性,由Schaefer定义的广义可满足性问题的类尖锐的阈值。在所有约束条件的情况下,我们给这样的问题,有一个尖锐的阈值的一个完整的表征。虽然NP-完全性并不意味着(即使在这种限制情况下)存在一个尖锐的阈值,但它“几乎意味着”这一点,因为缺乏尖锐阈值的子句广义可满足性问题是1。多项式时间可解,或2.预测,成功的概率下界由一些积极的常数,通过在所有的概率范围内,由一个单一的,平凡的过程。

英文摘要:

Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been addressed in Statistical Mechanics and Artificial Intelligence, but not studied rigorously. We take a step in this direction by investigating the existence of sharp thresholds for the class of generalized satisfiability problems defined by Schaefer. In the case when all constraints are clauses we give a complete characterization of such problems that have a sharp threshold. While NP-completeness does not imply (even in this restricted case) the existence of a sharp threshold, it "almost implies" this, since clausal generalized satisfiability problems that lack a sharp threshold are either 1. polynomial time solvable, or 2. predicted, with success probability lower bounded by some positive constant by across all the probability range, by a single, trivial procedure.

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

↑