Random k-SAT and the Power of Two Choices

  title={Random k-SAT and the Power of Two Choices},
  author={Will Perkins},
  journal={Random Struct. Algorithms},
We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-CNF clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well-studied area of probabilistic combinatorics (Achlioptas processes) to random CSP’s. In particular, while a rule to delay the 2-SAT threshold was known previously, this is the first… CONTINUE READING

Similar Papers

Loading similar papers…