Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

This is a written record of a survey talk on the topic of typical case complexity of Satisfiability algorithms which was presented at the LICS workshop on this subject in June, 2003, Ottawa, Canada.