A probabilistic analysis of a new satisfiability algorithm

This publication has 6 references indexed in Scilit:

• Satisfiability problems for propositional calculi
  Theory of Computing Systems, 1979
• The complexity of satisfiability problems
  Published by Association for Computing Machinery (ACM) ,1978
• On the Computational Complexity of Combinatorial Problems
  Networks, 1975
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• The Multiplicative Process
  The Annals of Mathematical Statistics, 1949