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
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
暂无
中图分类号
学科分类号
摘要
Message passing
引用
收藏
页码:957 / 966
相关论文
共 50 条
  • [31] Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
    Zhao, Chun-Yan
    Fu, Yan-Rong
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2021, 2021 (03):
  • [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] kcnfs:: An efficient solver for random k-SAT formulae
    Dequen, G
    Dubois, O
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 486 - 501
  • [35] The high temperature case for the random K-sat problem
    Michel Talagrand
    Probability Theory and Related Fields, 2001, 119 : 187 - 212
  • [36] An efficient approach to solving random k-sat problems
    Dequen, Gilles
    Dubois, Olivier
    Journal of Automated Reasoning, 2006, 37 (04): : 261 - 276
  • [37] The high temperature case for the random K-sat problem
    Talagrand, M
    PROBABILITY THEORY AND RELATED FIELDS, 2001, 119 (02) : 187 - 212
  • [38] 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
  • [39] Complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 237 - 240
  • [40] On the complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (02) : 367 - 375