A simplified way of proving trade-off results for resolution
We present a greatly simplified proof of the length-space trade-off result for resolution in [P. Hertel, T. Pitassi, Exponential time/space speedups for resolution and the PSPACE-completeness of black-white pebbling, in: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS '07). Oct. 2007, pp. 137-149], and also prove a couple of other theorems in the same vein. We point out two important ingredients needed for our proofs to work, and discuss some possible conclusions. Our key trick is to look at formulas of the type F = G Lambda H, where G and H are over disjoint sets of variables and have very different length-space properties with respect to resolution. (C) 2009 Elsevier B.V. All rights reserved.
trade-offs resolution space computational complexity automatic theorem proving proof complexity length width