Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
- 1 December 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (6) , 1119-1127
- https://doi.org/10.1137/0220069
Abstract
No abstract availableKeywords
This publication has 5 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
- 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