On belief propagation guided decimation for random k-SAT

被引：0
|
作者：
Coja-Oghlan, Amin [1 ]
机构：
[1] Mathematics and Computer Science, University of Warwick, Zeeman Building, Coventry CV4 7AL, United Kingdom
来源：
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2011年
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Message passing
引用
收藏
页码：957 / 966
相关论文
共 50 条
  • [21] A novel weighting scheme for random k-SAT
    Liu, Jun
    Xu, Ke
    SCIENCE CHINA-INFORMATION SCIENCES, 2016, 59 (09)
  • [22] 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
  • [23] 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
  • [24] 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
  • [25] Satisfiability threshold of the skewed random k-SAT
    Sinopalnikov, DA
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 263 - 275
  • [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