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
R. Raz, P. McKenzie, Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, 234
M.L. Bonet, T. Pitassi, R. Raz, Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, 254
K.W. Regan, D. Sivakumar, Jin-Yi Cai, Proceedings of IEEE 36th Annual Foundations of Computer Science, 1995, 26
Jan Krajíček, Pavel Pudlák, Lecture Notes in Computer Science, 960, Logic and Computational Complexity, 1995, 210
Alexander A. Razborov, Feasible Mathematics II, 1995, 344