Towards an optimal separation of space and length in resolution
Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used, fn the field of proof complexity, the resources of time and memory correspond to the length and space of resolution proofs. There has been a long line of research trying to