Message passing in random satisfiability problems

被引：0
|
作者：
Mézard, M [1 ]
机构：
[1] Univ Paris 11, Lab Phys Theor & Modeles Stat, CNRS, F-91405 Orsay, France
来源：
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16 | 2004年 / 16卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generalization of the belief propagation strategy that is able to deal with the clustering of solutions in these problems. It allows to derive analytic results on their phase diagrams, and offers a new algorithmic framework.
引用
收藏
页码：1061 / 1068
页数：8
相关论文
共 50 条
  • [1] Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
    Feige, Uriel
    Mossel, Elchanan
    Vilenchik, Dan
    [J]. Theory of Computing, 2013, 9 : 617 - 651
  • [2] Complete convergence of message passing algorithms for some satisfiability problems
    Feige, Uriel
    Mossel, Elchanan
    Vilenchik, Dan
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 339 - 350
  • [3] Predicting Propositional Satisfiability via Message Passing Relation Network
    Bao, Dong-Qing
    Ge, Ning
    Zhai, Shu-Mao
    Zhang, Li
    [J]. Ruan Jian Xue Bao/Journal of Software, 2022, 33 (08): : 2839 - 2850
  • [4] A message-passing approach to random constraint satisfaction problems with growing domains
    Zhao, Chunyan
    Zhou, Haijun
    Zheng, Zhiming
    Xu, Ke
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2011,
  • [5] Spanning trees in random satisfiability problems
    Ramezanpour, A.
    Moghimi-Araghi, S.
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2006, 39 (18): : 4901 - 4909
  • [6] On Ordering Problems in Message Passing Software
    Long, Yuheng
    Bagherzadeh, Mehdi
    Lin, Eric
    Upadhyaya, Ganesha
    Rajan, Hridesh
    [J]. PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON MODULARITY (MODULARITY'16), 2016, : 54 - 65
  • [7] Throughput of Random Access without Message Passing
    Proutiere, Alexandre
    Yi, Yung
    Chiang, Mung
    [J]. 2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, : 509 - +
  • [8] ON THE COMPLEXITY OF RANDOM SATISFIABILITY PROBLEMS WITH PLANTED SOLUTIONS
    Feldman, Vitaly
    Perkins, Will
    Vempala, Santosh
    [J]. SIAM JOURNAL ON COMPUTING, 2018, 47 (04) : 1294 - 1338
  • [9] Analytic and algorithmic solution of random satisfiability problems
    Mézard, M
    Parisi, G
    Zecchina, R
    [J]. SCIENCE, 2002, 297 (5582) : 812 - 815
  • [10] On the Complexity of Random Satisfiability Problems with Planted Solutions
    Feldman, Vitaly
    Perkins, Will
    Vempala, Santosh
    [J]. STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 77 - 86
12345