Probabilistic performance of a heuristic for the satisfiability problem
- 1 December 1988
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 22 (1) , 35-51
- https://doi.org/10.1016/0166-218x(88)90121-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1987
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability ProblemSIAM Journal on Computing, 1986
- On the probabilistic performance of algorithms for the satisfiability problemInformation Processing Letters, 1986
- The Pure Literal Rule and Polynomial Average TimeSIAM Journal on Computing, 1985
- 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
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960