M. Alekhnovich, A.A. Razborov, Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 2001, 190
Jan Krajíček, “Randomized feasible interpolation and monotone circuits with a local oracle”, J. Math. Log., 18, no. 02, 2018, 1850012
Ran Raz, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002, 553
Samuel R. Buss, “Towards NP–P via proof complexity and search”, Annals of Pure and Applied Logic, 163, no. 7, 2012, 906
Jan Krajíček, “A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems”, Proc. Amer. Math. Soc., 143, no. 11, 2015, 4951
M.L. Bonet, N. Galesi, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999, 422
Erfan Khaniki, “On Proof Complexity of Resolution over Polynomial Calculus”, ACM Trans. Comput. Logic, 23, no. 3, 2022, 1
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen, “Space Complexity in Polynomial Calculus”, SIAM J. Comput., 44, no. 4, 2015, 1119
Toniann Pitassi, Robert Robere, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 1207
Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 188