On the probabilistic performance of algorithms for the satisfiability problem
- 20 August 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (2) , 103-106
- https://doi.org/10.1016/0020-0190(86)90051-7
Abstract
No abstract availableKeywords
This 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
- A probabilistic analysis of the set covering 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
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960