On the Probabilistic approach to the random satisfiability problem

被引：0
|
作者：
Parisi, G
机构：
[1] Univ Roma La Sapienza, Dipartimento Fis, Sez INFN, SMC, I-00185 Rome, Italy
[2] Univ Roma La Sapienza, UdRmI, INFM, I-00185 Rome, Italy
来源：
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING | 2004年 / 2919卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random 3-satisfiability problem a phase transition from the, satisfiable to the unsatisfiable phase is found at alpha = 4.267. There are other values of a that separates different regimes and they will be described in details. In this context the properties of the survey decimation algorithm will also be discussed.
引用
收藏
页码：203 / 213
页数：11
相关论文
共 50 条
  • [1] PROBABILISTIC APPROACH TO THE SATISFIABILITY PROBLEM
    DUBOIS, O
    CARLIER, J
    [J]. THEORETICAL COMPUTER SCIENCE, 1991, 81 (01) : 65 - 75
  • [2] The satisfiability problem for probabilistic CTL
    Brazdil, Tomas
    Forejt, Vojtech
    Kretinsky, Jan
    Kucera, Antonin
    [J]. TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 391 - 402
  • [3] PROBABILISTIC PERFORMANCE OF A HEURISTIC FOR THE SATISFIABILITY PROBLEM
    FRANCO, J
    HO, YC
    [J]. DISCRETE APPLIED MATHEMATICS, 1988, 22 (01) : 35 - 51
  • [4] ON THE PROBABILISTIC PERFORMANCE OF ALGORITHMS FOR THE SATISFIABILITY PROBLEM
    FRANCO, J
    [J]. INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 103 - 106
  • [5] A probabilistic approach to the leader problem in random graphs
    Addario-Berry, Louigi
    Bhamidi, Shankar
    Sen, Sanchayan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2021, 58 (01) : 34 - 67
  • [6] An exactly solvable random satisfiability problem
    Caracciolo, S
    Sportiello, A
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2002, 35 (36): : 7661 - 7688
  • [7] Probabilistic sentence satisfiability: An approach to PSAT
    Henderson, T. C.
    Simmons, R.
    Serbinowski, B.
    Cline, M.
    Sacharny, D.
    Fan, X.
    Mitiche, A.
    [J]. ARTIFICIAL INTELLIGENCE, 2020, 278 (278)
  • [8] The satisfiability problem for probabilistic ordered branching programs
    Agrawal, M
    Thierauf, T
    [J]. THEORY OF COMPUTING SYSTEMS, 2001, 34 (05) : 471 - 487
  • [9] The Satisfiability Problem for Probabilistic Ordered Branching Programs
    M. Agrawal
    T. Thierauf
    [J]. Theory of Computing Systems, 2001, 34 : 471 - 487
  • [10] PROBABILISTIC ESTIMATES FOR THE GENERALIZED MAXIMUM SATISFIABILITY PROBLEM
    COCHAND, M
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) : 143 - 163
12345