Information on k-SAT (Introduction, Bounds, Methods, etc.) I'd like to know where I can turn for a good, gentle introduction to k-SAT (this may be for mathematicians that may not have a good computer science background).  I'd also like to know papers that maybe survey or explain current methods used to solve k-SAT.  Finally, I'm interested in the best known methods for solving k-SAT.  I'd like to get an idea of the best average case and best worst case behavior.

In short, I'm looking for papers that will help someone in mathematics (not computer science) become much more of an expert in k-SAT.
From the Lecture Note reference thread, we have this document.