M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, A. Wigderson, Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000, 43
Olaf Beyersdorff, “On the correspondence between arithmetic theories and propositional proof systems – a survey”, Mathematical Logic Qtrly, 55, no. 2, 2009, 116
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki, “The complexity of the Hajós calculus for planar graphs”, Theoretical Computer Science, 411, no. 7-9, 2010, 1182
A.A. Razborov, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004, 134
Alexander A. Razborov, 3142, Automata, Languages and Programming, 2004, 8
Albert Atserias, Moritz Müller, “Partially definable forcing and bounded arithmetic”, Arch. Math. Logic, 54, no. 1-2, 2015, 1
Alexander Razborov, 6072, Computer Science – Theory and Applications, 2010, 340
Alexander A. Razborov, 2295, Developments in Language Theory, 2002, 100
K. Subramani, 2550, Advances in Computing Science — ASIAN 2002, 2002, 57
Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math., 181, no. 2, 2015, 415