- GIORDANO FUSCO, ERIC BACH, “Phase transition of multivariate polynomial systems”, Math. Struct. Comp. Sci., 19, no. 1, 2009, 9
![https://doi.org/10.1017/S0960129508007251 crossref](/refsvg/svg/crossref.svg)
- Dima Grigoriev, “Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity”, Theoretical Computer Science, 259, no. 1-2, 2001, 613
![https://doi.org/10.1016/S0304-3975(00)00157-2 crossref](/refsvg/svg/crossref.svg)
- Iddo Tzameret, 6108, Theory and Applications of Models of Computation, 2010, 60
![https://doi.org/10.1007/978-3-642-13562-0_7 crossref](/refsvg/svg/crossref.svg)
- 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
![https://doi.org/10.1145/1740582.1740587 crossref](/refsvg/svg/crossref.svg)
- Jan Krajíček, “Randomized feasible interpolation and monotone circuits with a local oracle”, J. Math. Log., 18, no. 02, 2018, 1850012
![https://doi.org/10.1142/S0219061318500125 crossref](/refsvg/svg/crossref.svg)
- Nathan Segerlind, “The Complexity of Propositional Proofs”, Bull. symb. log., 13, no. 4, 2007, 417
![https://doi.org/10.2178/bsl/1203350879 crossref](/refsvg/svg/crossref.svg)
- Jan Krajíček, Proof Complexity, 2019
![https://doi.org/10.1017/9781108242066 crossref](/refsvg/svg/crossref.svg)
- M. Alekhnovich, A.A. Razborov, Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 2001, 190
![https://doi.org/10.1109/SFCS.2001.959893 crossref](/refsvg/svg/crossref.svg)
- Russell Impagliazzo, Nathan Segerlind, 2380, Automata, Languages and Programming, 2002, 208
![https://doi.org/10.1007/3-540-45465-9_19 crossref](/refsvg/svg/crossref.svg)
- Jan Krajíček, “Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds”, J. symb. log., 69, no. 1, 2004, 265
![https://doi.org/10.2178/jsl/1080938841 crossref](/refsvg/svg/crossref.svg)