A threshold for unsatisfiability

This publication has 7 references indexed in Scilit:

• Counting the number of solutions for instances of satisfiability
  Theoretical Computer Science, 1991
• Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
  SIAM Journal on Computing, 1986
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
  Mathematical Programming, 1986
• Probabilistic analysis of the pure literal heuristic for the satisfiability problem
  Annals of Operations Research, 1984
• Average time analysis of simplified Davis-Putnam procedures
  Information Processing Letters, 1982
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• Large cycles in large labelled graphs
  Mathematical Proceedings of the Cambridge Philosophical Society, 1975