S. Margulies, S. Onn, D.V. Pasechnik, “On the complexity of Hilbert refutations for partition”, Journal of Symbolic Computation, 66, 2015, 70
Albert Atserias, Massimo Lauria, Jakob Nordstrom, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 286
Dima Grigoriev, Nicolai Vorobjov, “Complexity of Null- and Positivstellensatz proofs”, Annals of Pure and Applied Logic, 113, no. 1-3, 2001, 153
Dima Grigoriev, “Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity”, Theoretical Computer Science, 259, no. 1-2, 2001, 613
Olaf Beyersdorff, “On the correspondence between arithmetic theories and propositional proof systems – a survey”, Mathematical Logic Qtrly, 55, no. 2, 2009, 116
Ilario Bonacina, Nicola Galesi, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013, 455
Albert Atserias, Nicola Galesi, Ricard Gavaldá, 1853, Automata, Languages and Programming, 2000, 151
Eli Ben-Sasson, Prahladh Harsha, “Lower bounds for bounded depth Frege proofs via Pudlák-Buss games”, ACM Trans. Comput. Logic, 11, no. 3, 2010, 1
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 54
S. Buss, R. Impagliazzo, J. Krajíček, P. Pudlák, A. A. Razborov, J. Sgall, “Proof complexity in algebraic systems and bounded depth Frege systems with modular counting”, Comput Complexity, 6, no. 3, 1996, 256