Random 2-SAT: results and problems

This publication has 15 references indexed in Scilit:

• The scaling window of the 2‐SAT transition
  Random Structures & Algorithms, 2001
• Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
  Published by Association for Computing Machinery (ACM) ,2000
• Uniform boundedness of critical crossing probabilities implies hyperscaling
  Random Structures & Algorithms, 1999
• Length of prime implicants and number of solutions of random CNF formulae
  Theoretical Computer Science, 1999
• The existence of uniquely −G colourable graphs
  Discrete Mathematics, 1998
• A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
  Journal of Algorithms, 1997
• Mick gets some (the odds are on his side) (satisfiability)
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
  SIAM Journal on Computing, 1986
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• Weighted sums of certain dependent random variables
  Tohoku Mathematical Journal, 1967