共 27 条
[1]
Beame P.(2002)The efficiency of resolution and Davis–Putnam procedures SIAM 31 1048-1075
[2]
Karp R.(1999)Length of prime implicants and number of solutions of random CNF formulae Theor. Comp. Sci. 215 1-30
[3]
Pitassi T.(2004)Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances Theor. Comp. Sci. 320 345-372
[4]
Saks M.(1962)A machine program for theorem-proving J. Assoc. Comput. Mach. 5 394-397
[5]
Boufkhad Y.(1997)A general upper bound for the satisfiability threshold of random J. Algorithms 24 395-420
[6]
Dubois O.(1996)-SAT formulae Artif. Intell. 81 183-198
[7]
Cocco S.(2003)Hard random 3-SAT problems and the Davis–Putnam procedure Comb. Probab. Comput. 12 245-267
[8]
Monasson R.(2000)Some results on random unsatisfiable k-Sat instances and approximation algorithms applied to random structures J. Autom. Reason. 24 421-481
[9]
Davis M.(2002)Local search algorithms for SAT: An empirical evaluation Science 297 812-815
[10]
Logemann G.(1999)Analytic and algorithmic solutions of random satisfiability problems J. Log. Comput. 9 501-513