The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-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 firstarXiv:1209.5313v2 fatcat:a3v2gx46rjgdhh4oc7mlggqxp4