Proving unsatisfiability for problems with constant cubic sparsity
- 30 September 1992
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 57 (1) , 125-137
- https://doi.org/10.1016/0004-3702(92)90107-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability ProblemSIAM Journal on Computing, 1986
- The Pure Literal Rule and Polynomial Average TimeSIAM Journal on Computing, 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
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- An Average Time Analysis of BacktrackingSIAM Journal on Computing, 1981
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974