A survey of average time analyses of satisfiability algorithms

Average case results for satisfiability algorithms under the random-clause-width model

Annals of Mathematics and Artificial Intelligence

Backtracking and random constraint satisfaction

Annals of Mathematics and Artificial Intelligence

Convergence Properties of Optimization Algorithms for the SAT Problem

IEEE Transactions on Computers

Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

Relational approach to boolean logic problems

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra

A generating function method for the average-case analysis of DPLL

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

A weight-balanced branching rule for SAT

Mathematical and Computer Modelling: An International Journal

Backtracking tactics in the backtrack method for SAT

Mathematical and Computer Modelling: An International Journal