Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
- 1 November 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (4) , 1106-1118
- https://doi.org/10.1137/0215080
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The Pure Literal Rule and Polynomial Average TimeSIAM Journal on Computing, 1985
- Probabilistic analysis of the pure literal heuristic for the satisfiability problemAnnals of Operations Research, 1984
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982
- An Average Time Analysis of BacktrackingSIAM Journal on Computing, 1981
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960