CNF-Satisfiability Test by Counting and Polynomial Average Time
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 385-391
- https://doi.org/10.1137/0218026
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Complementary Approaches to CNF Boolean EquationsPublished by Elsevier ,1987
- 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
- An Average Time Analysis of BacktrackingSIAM Journal on Computing, 1981
- Backtracking with multi-level dynamic search rearrangementActa Informatica, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Tree Size by Partial BacktrackingSIAM Journal on Computing, 1978
- On Backtracking: A Combinatorial Description of the AlgorithmSIAM Journal on Computing, 1974