Solving the satisfiability problem by using randomized approach
- 1 March 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 41 (4) , 187-190
- https://doi.org/10.1016/0020-0190(92)90177-w
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Exponential Average Time for the Pure Literal RuleSIAM Journal on Computing, 1989
- CNF-Satisfiability Test by Counting and Polynomial Average TimeSIAM Journal on Computing, 1989
- Probabilistic performance of a heuristic for the satisfiability problemDiscrete Applied Mathematics, 1988
- Polynomial-average-time satisfiability problemsInformation Sciences, 1987
- 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
- An Analysis of Backtracking with Search RearrangementSIAM Journal on Computing, 1983
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960