Lower bounds for random 3-SAT via differential equations

This publication has 22 references indexed in Scilit:

• A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
  Published by Elsevier ,2013
• Results related to threshold phenomena research in satisfiability: lower bounds
  Theoretical Computer Science, 2001
• Random constraint satisfaction: A more accurate picture
  Published by Springer Nature ,1997
• Analysis of Two Simple Heuristics on a Random Instance ofk-sat
  Journal of Algorithms, 1996
• Differential Equations for Random Processes and Random Graphs
  The Annals of Applied Probability, 1995
• A critical point for random graphs with a given degree sequence
  Random Structures & Algorithms, 1995
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
  Information Sciences, 1990
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
  Discrete Applied Mathematics, 1983
• The asymptotic number of labeled graphs with given degree sequences
  Journal of Combinatorial Theory, Series A, 1978
• Solutions of ordinary differential equations as limits of pure jump markov processes
  Journal of Applied Probability, 1970