Dieter van Melkebeek (University of Wisconsin, Madison):
Time-Space Lower Bounds for NP-Complete Problems - Part I
We survey the known lower bounds on the running time of algorithms for NP-complete problems like satisfiability that use a small amount of work space.