Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
- 31 August 1990
- journal article
- Published by Elsevier in Information Sciences
- Vol. 51 (3) , 289-314
- https://doi.org/10.1016/0020-0255(90)90030-e
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability ProblemSIAM Journal on Computing, 1986
- 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
- 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
- An Average Time Analysis of BacktrackingSIAM Journal on Computing, 1981
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960