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 条
  • [21] Bounds on Threshold of Regular Random k-SAT
    Rathi, Vishwambhar
    Aurell, Erik
    Rasmussen, Lars
    Skoglund, Mikael
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 264 - 277
  • [22] Strong refutation heuristics for random k-SAT
    Coja-Oghlan, A
    Goerdt, A
    Lanka, A
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 310 - 321
  • [23] The asymptotic order of the random k-SAT threshold
    Achlioptas, D
    Moore, C
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 779 - 788
  • [24] Satisfiability threshold of the skewed random k-SAT
    Sinopalnikov, DA
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 263 - 275
  • [25] Survey and Belief Propagation on random K-SAT
    Braunstein, A
    Zecchina, R
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 519 - 528
  • [26] Random k-SAT and the power of two choices
    Perkins, Will
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 163 - 173
  • [27] A novel weighting scheme for random k-SAT关于随机 k-SAT 的新加权方法
    Jun Liu
    Ke Xu
    Science China Information Sciences, 2016, 59
  • [28] Random k-SAT:: A tight threshold for moderately growing k
    Frieze, A
    Wormald, NC
    COMBINATORICA, 2005, 25 (03) : 297 - 305
  • [29] Random k-Sat: A Tight Threshold For Moderately Growing k
    Alan Frieze*
    Nicholas C. Wormald†
    Combinatorica, 2005, 25 : 297 - 305
  • [30] Regular Random k-SAT: Properties of Balanced Formulas
    Yacine Boufkhad
    Olivier Dubois
    Yannet Interian
    Bart Selman
    Journal of Automated Reasoning, 2005, 35 : 181 - 200
12345