  We prove that a random 3-SAT instance with clause-to-variable density less
than 3.52 is satisfiable with high probability. The proof comes through an
algorithm which selects (and sets) a variable depending on its degree and that
of its complement.
