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 条
  • [41] Random k-SAT:: the limiting probability for satisfiability for moderately growing k
    Coja-Oghlan, Amin
    Frieze, Alan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [42] Improving configuration checking for satisfiable random k-SAT instances
    Abrame, Andre
    Habet, Djamal
    Toumi, Donia
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2017, 79 (1-3) : 5 - 24
  • [43] Satisfiability and Algorithms for Non-uniform Random k-SAT
    Omelchenko, Oleksii
    Bulatov, Andrei A.
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 3886 - 3894
  • [44] Analysis of two simple heuristics on a random instance of k-SAT
    Frieze, A
    Suen, S
    JOURNAL OF ALGORITHMS, 1996, 20 (02) : 312 - 355
  • [45] Recognizing more unsatisfiable random k-sat instances efficiently
    Friedman, J
    Goerdt, A
    Krivelevich, M
    SIAM JOURNAL ON COMPUTING, 2005, 35 (02) : 408 - 430
  • [46] Threshold values of random K-SAT from the cavity method
    Mertens, S
    Mézard, M
    Zecchina, R
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (03) : 340 - 373
  • [47] The Number of Satisfying Assignments of Random Regular k-SAT Formulas
    Coja-Oghlan, Amin
    Wormald, Nick
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (04): : 496 - 530
  • [48] Improving configuration checking for satisfiable random k-SAT instances
    André Abramé
    Djamal Habet
    Donia Toumi
    Annals of Mathematics and Artificial Intelligence, 2017, 79 : 5 - 24
  • [49] Counting good truth assignments of random k-SAT formulae
    Montanari, Andrea
    Shah, Devavrat
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1255 - +
  • [50] On the average similarity degree between solutions of random k-SAT and random CSPs
    Xu, K
    Li, W
    DISCRETE APPLIED MATHEMATICS, 2004, 136 (01) : 125 - 149
12345