Upper bounds on the satisfiability threshold
Résumé
We present a survey of upper bounds which has been established up to now on the satisfiability threshold of random k-SAT formulae. The ideas which led to these bounds and the techniques used to obtain them, are explained. A companion paper in this volume present a survey of the lower bounds.