Polynomial-average-time satisfiability problems
- 28 February 1987
- journal article
- Published by Elsevier in Information Sciences
- Vol. 41 (1) , 23-42
- https://doi.org/10.1016/0020-0255(87)90003-x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- Probabilistic analysis of the pure literal heuristic for the satisfiability problemAnnals of Operations Research, 1984
- An Analysis of Backtracking with Search RearrangementSIAM Journal on Computing, 1983
- Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristicsArtificial 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
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960