MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  On the probabilistic performance of algorithms for the satisfiability problem (1986) [20 citations — 7 self]

Download:
Download as a PDF | Download as a PS
by John Franco
Information Processing Letters
http://www.ececs.uc.edu/~franco/Reports/ipl.ps
Add To MetaCart

Abstract:

The Satisfiability problem (SAT) is the problem of determining whether a given collection I of disjunctions (clauses) of boolean literals can all be satisfied (have value true) by some consistent assignment of truth values to the literals of I (truth

Citations

799 A computing procedure for quantification theory – DAVIS, PUTNAM - 1960
226 Fast probabilistic algorithms for hamiltonian circuits and matchings – Angluin, Valiant - 1979
74 Probabilistic analysis of a generalization of the unit clause literal selection heuristic for the k-satisfiability problem – Chao, Franco - 1990
35 Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem – Franco, Paull - 1983
28 The Pure Literal Rule and Polynomial Average Time – Purdom, Brown - 1985
18 Probabilistic analysis of the pure literal heuristic for the satis ability problem – Franco - 1984
9 Average time analyses of simplified Davis-Putnam Procedures – Goldberg, Purdom, et al. - 1982
4 A probabilistic analysis of the Set Covering Problem – Vercellis - 1984
2 Search rearrangement bactracking and polynomial average time – Purdom - 1983
1 Probabilistic analysis of the unit clause and maximum occurring literal selection heuristics for the 3-satisfiability problem – Chao, Franco - 1985
View or Download | Add to My Collection | Correct Errors