Some pitfalls for experimenters with random SAT

This publication has 12 references indexed in Scilit:

• Critical behavior in the computational cost of satisfiability testing
  Artificial Intelligence, 1996
• Solving satisfiability via Boltzmann machines
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1993
• Efficient local search for very large-scale satisfiability problems
  ACM SIGART Bulletin, 1992
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
  Information Sciences, 1990
• Algorithms for testing the satisfiability of propositional formulae
  The Journal of Logic Programming, 1989
• Resolution vs. cutting plane solution of inference problems: Some computational experience
  Operations Research Letters, 1988
• On the probabilistic performance of algorithms for the satisfiability problem
  Information Processing Letters, 1986
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• A machine program for theorem-proving
  Communications of the ACM, 1962
• A Computing Procedure for Quantification Theory
  Journal of the ACM, 1960