An exponential lower bound for the pure literal rule
- 8 April 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (4) , 215-219
- https://doi.org/10.1016/0020-0190(88)90028-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial-average-time satisfiability problemsInformation Sciences, 1987
- The Pure Literal Rule and Polynomial Average TimeSIAM Journal on Computing, 1985
- Average time analyses of simplified Davis-Putnam procedures: Information processing letters 15(2) (September 1983) pp. 72–75Information Processing Letters, 1983
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982
- A machine program for theorem-provingCommunications of the ACM, 1962