1. Alekhnovich, M., Ben-Sasson, E., Razborov, A.A., Wigderson, A.: Space complexity in propositional calculus. SIAM Journal on Computing 31(4), 1184–1211 (2002)
2. Lecture Notes in Computer Science;V. Arvind,2000
3. Beyersdorff, O., Galesi, N., Lauria, M.: The strength of parameterized tree-like resolution (preprint, 2010)
4. Lecture Notes in Computer Science;O. Beyersdorff,2009
5. Beyersdorff, O., Müller, S.: A tight Karp-Lipton collapse result in bounded arithmetic. ACM Transactions on Computational Logic (to appear)