Biased random k-SAT

Abstract

The basic random k-SAT problem is: Given a set of n Boolean variables, and m clauses of size k picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable?Here we consider a variation of this problem where there is a bias towards variables occurring positive -i.e. variables occur negated w.p. 0 < p < 1