Jan Krajíček, “A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems”, Proc. Amer. Math. Soc., 143, no. 11, 2015, 4951
Samuel R. Buss, “Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies”, Theoretical Computer Science, 357, no. 1-3, 2006, 35
Toniann Pitassi, Iddo Tzameret, “Algebraic proof complexity”, ACM SIGLOG News, 3, no. 3, 2016, 21
Russell Impagliazzo, Nathan Segerlind, “Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations”, ACM Trans. Comput. Logic, 7, no. 2, 2006, 199
Dima Grigoriev, Nicolai Vorobjov, “Complexity of Null- and Positivstellensatz proofs”, Annals of Pure and Applied Logic, 113, no. 1-3, 2001, 153
D. Grigoriev, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 648
Samuel R. Buss, Alan S. Johnson, “Propositional proofs and reductions between NP search problems”, Annals of Pure and Applied Logic, 163, no. 9, 2012, 1163
Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik, 2285, STACS 2002, 2002, 419
Iddo Tzameret, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 41
Iddo Tzameret, “Algebraic proofs over noncommutative formulas”, Information and Computation, 209, no. 10, 2011, 1269