1. Aisenberg, J., Bonet, M.L., Buss, S.: Quasi-polynomial size Frege proofs of Frankl’s theorem on the trace of finite sets. J. Symbolic Log. (to appear)
2. Aisenberg, J., Bonet, M.L., Buss, S., Crãciun, A., Istrate, G.: Short proofs of the Kneser-Lovász principle. In: Proceedings of 42th International Colloquium on Automata, Languages, and Programming (ICALP 2015) (2015) (to appear)
3. Avigad, J.: Plausibly hard combinatorial tautologies. In: Beame, P., Buss, S.R. (eds.) Proof Complexity and Feasible Arithmetics, pp. 1–12. American Mathematical Society, Rutgers (1997)
4. IAS/Park City Mathematical Series;P Beame,2004
5. Beame, P., Pitassi, T.: Propositional proof complexity: past, present and future. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science Entering the 21st Century, pp. 42–70. World Scientific Publishing Co. Ltd, Singapore (2001). Earlier version appeared in Computational Complexity Column, Bulletin of the EATCS (2000)