Review of The Satisfiability Problem: Algorithms and Analyses by Uwe Schöning and Jacobo Torán

This book is mostly concerned with item 2algorithms for SAT that you can actually analyze. However, there is one chapter on resolution lower bounds and one chapter on using methods of Physics to solve SAT. There are also some sections on real world SAT solvers. At the University of Maryland we currently do not teach SAT algorithms in the algorithms course. This wonderful book may change that as it lays out clearly some simple (and some complicated) algorithms for 3-SAT (and k-SAT) that take time c for c < 2. Students already learn about approximation algorithms and FPT algorithms to get around NP-completeness; however exponential-but-not-too-bad should also be taught.