Results related to threshold phenomena research in satisfiability: lower bounds

被引:28
作者
Franco, J [1 ]
机构
[1] Univ Cincinnati, ECECS, Cincinnati, OH 45221 USA
关键词
satisfiability; phase transition;
D O I
10.1016/S0304-3975(01)00158-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 [计算机软件与理论];
摘要
We present a history of results related to the threshold phenomena which arise in the study of random conjunctive normal form (CNF) formulas. In a companion paper (D. Achlioptas, Theoret. Comput. Sci., this volume) the major ideas used to achieve many of the lower bounds results on the location of the threshold are described in an informal, intuitive manner. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:147 / 157
页数:11
相关论文
共 29 条
[1]
Optimal myopic algorithms for random 3-SAT [J].
Achlioptas, D ;
Sorkin, GB .
41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, :590-600
[2]
Lower bounds for random 3-SAT via differential equations [J].
Achlioptas, D .
THEORETICAL COMPUTER SCIENCE, 2001, 265 (1-2) :159-185
[3]
Achlioptas D, 1997, LECT NOTES COMPUT SC, V1330, P107, DOI 10.1007/BFb0017433
[4]
ACHLIOPTAS D, 2000, 32 ACM S THEOR COMP
[5]
ACHLIOPTAS D, 1999, 38 ANN S FDN COMP SC, P204
[6]
BOLLOBAS B, 1999, SCALING WINDOW 2 SAT
[7]
PROBABILISTIC ANALYSIS OF 2 HEURISTICS FOR THE 3-SATISFIABILITY PROBLEM [J].
CHAO, MT ;
FRANCO, J .
SIAM JOURNAL ON COMPUTING, 1986, 15 (04) :1106-1118
[8]
CHAO MT, 1990, INFORM SCI, V51, P1106
[9]
CHVATAL V, 1992, AN S FDN CO, P620
[10]
COOK SA, 1971, 3RD P ANN ACM S THEO, P151