Solving satisfiability in less than 2n steps
- 1 March 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (3) , 287-295
- https://doi.org/10.1016/0166-218x(85)90050-2
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Average time analyses of simplified Davis-Putnam procedures: Information processing letters 15(2) (September 1983) pp. 72–75Information Processing Letters, 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
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971