Exponential Average Time for the Pure Literal Rule
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 409-418
- https://doi.org/10.1137/0218028
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An exponential lower bound for the pure literal ruleInformation Processing Letters, 1988
- Polynomial-average-time satisfiability problemsInformation Sciences, 1987
- The Pure Literal Rule and Polynomial Average TimeSIAM Journal on Computing, 1985
- 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
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976