Exact satisfiability, a natural extension of set partition, and its average case behavior
- 1 March 1992
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 6 (1) , 185-200
- https://doi.org/10.1007/bf01531028
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the average case complexity of backtracking for the exact-satisfiability problemPublished by Springer Nature ,1988
- 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
- An Analysis of Backtracking with Search RearrangementSIAM Journal on Computing, 1983
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982
- An Average Time Analysis of BacktrackingSIAM Journal on Computing, 1981
- Asymptotic Methods in EnumerationSIAM Review, 1974