Hard random 3-SAT problems and the Davis-Putnam procedure
Open Access
- 1 March 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 81 (1-2) , 183-198
- https://doi.org/10.1016/0004-3702(95)00051-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994
- Branching rules for satisfiabilityPublished by Springer Nature ,1994
- On the greedy algorithm for satisfiabilityInformation Processing Letters, 1992
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990
- Many hard examples for resolutionJournal of the ACM, 1988
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960