Toniann Pitassi, Iddo Tzameret, “Algebraic proof complexity”, ACM SIGLOG News, 3:3 (2016), 21
Alexander Razborov, “Guest Column”, SIGACT News, 47:2 (2016), 66
A. Atserias, M. Müller, S. Oliva, “Lower bounds for DNF-refutations of a relativized weak pigeonhole principle”, J. Symb. Log., 80:2 (2015), 450–476
J. Pich,, “Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic”, Log. Methods Comput. Sci., 11:2 (2015), 8, 38 pp.
J. Pich, “Circuit lower bounds in bounded arithmetics”, Ann. Pure Appl. Logic, 166:1 (2015), 29–45