The high temperature case for the random K-sat problem

被引：0

作者：

Michel Talagrand

机构：

[1] Equipe d'Analyse,

[2] Tour 46,undefined

[3] ESA au CNRS no. 7064,undefined

[4] Université Paris VI,undefined

[5] 4,undefined

[6] place Jussieu,undefined

[7] 75230 Paris Cedex 05,undefined

[8] France,undefined

[9] (e-mail: mit@ccr.jussieu.fr),undefined

[10] Department of Mathematics,undefined

[11] The Ohio State University,undefined

[12] 231 West 18th Avenue,undefined

[13] Columbus,undefined

[14] OH 43210-1174,undefined

[15] USA. e-mail: talagran@math.ohio-state.edu,undefined

来源：

Probability Theory and Related Fields | 2001年 / 119卷

关键词：

Mathematics Subject Classification (2000): Primary 82D30; Secondary 60G99;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We give a completely rigorous proof that the replica-symmetric solution holds at high enough temperature for the random K-sat problem. The most notable feature of this problem is that the order parameter of the system is a function and not a number.

引用

页码：187 / 212

页数：25

共 50 条

[31] On belief propagation guided decimation for random k-SAT
Coja-Oghlan, Amin
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, : 957 - 966
[32] An Efficient Approach to Solving Random k-sat Problems
Gilles Dequen
Olivier Dubois
Journal of Automated Reasoning, 2006, 37 : 261 - 276
[33] An efficient approach to solving random k-SAT problems
Dequen, Gilles
Dubois, Olivier
JOURNAL OF AUTOMATED REASONING, 2006, 37 (04) : 261 - 276
[34] On Belief Propagation Guided Decimation for Random k-SAT
Coja-Oghlan, Amin
PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 957 - 966
[35] kcnfs:: An efficient solver for random k-SAT formulae
Dequen, G
Dubois, O
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 486 - 501
[36] An efficient approach to solving random k-sat problems
Dequen, Gilles
Dubois, Olivier
Journal of Automated Reasoning, 2006, 37 (04): : 261 - 276
[37] Regular random k-SAT:: Properties of balanced formulas
Boufkhad, Yacine
Dubois, Olivier
Interian, Yannet
Selman, Bart
JOURNAL OF AUTOMATED REASONING, 2005, 35 (1-3) : 181 - 200
[38] Sharp thresholds of graph properties, and the k-sat problem
Friedgut, E
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 1999, 12 (04) : 1017 - 1054
[39] Complexity of k-SAT
Impagliazzo, R
Paturi, R
FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 237 - 240
[40] Sharp thresholds of graph properties, and the k-sat problem
Jerrum, Mark R.
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 2021, 58 (02) : 267 - 268

← 1 2 3 4 5 →