GIORDANO FUSCO, ERIC BACH, “Phase transition of multivariate polynomial systems”, Math. Struct. Comp. Sci., 19, no. 1, 2009, 9
Dima Grigoriev, “Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity”, Theoretical Computer Science, 259, no. 1-2, 2001, 613
Iddo Tzameret, 6108, Theory and Applications of Models of Computation, 2010, 60
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
Jan Krajíček, “Randomized feasible interpolation and monotone circuits with a local oracle”, J. Math. Log., 18, no. 02, 2018, 1850012
Nathan Segerlind, “The Complexity of Propositional Proofs”, Bull. symb. log., 13, no. 4, 2007, 417
Jan Krajíček, Proof Complexity, 2019
M. Alekhnovich, A.A. Razborov, Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 2001, 190
Russell Impagliazzo, Nathan Segerlind, 2380, Automata, Languages and Programming, 2002, 208
Jan Krajíček, “Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds”, J. symb. log., 69, no. 1, 2004, 265