Allender E., Koucky M., “Amplifying Lower Bounds by Means of Self-Reducibility”, Twenty-Third Annual IEEE Conference on Computational Complexity, Proceedings, Annual IEEE Conference on Computational Complexity, IEEE Computer Soc, 2008, 31–40
Nathan Segerlind, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 100
Albert Atserias, Marı́a Luisa Bonet, “On the automatizability of resolution and related propositional proof systems”, Information and Computation, 189:2 (2004), 182
Bonet M., Domingo C., Gavalda R., Maciel A., Pitassi T., “Non-Automatizability of Bounded-Depth Frege Proofs”, Comput. Complex., 13:1-2 (2004), 47–68
A.A. Razborov, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004, 134
Atserias A., Bonet M., “On the Automatizability of Resolution and Related Propositional Proof Systems”, Computer Science Logic, Proceedings, Lecture Notes in Computer Science, 2471, ed. Bradfield J., Springer-Verlag Berlin, 2002, 569–583
M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, A. Wigderson, Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000, 43
M.L. Bonet, C. Domingo, R. Gavalda, A. Maciel, T. Pitassi, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 1999, 15
Razborov A., “Lower Bounds for the Polynomial Calculus”, Comput. Complex., 7:4 (1998), 291–324
Pudlak P., “Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations”, J. Symb. Log., 62:3 (1997), 981–998