Sam Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi, “Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes”, Journal of Computer and System Sciences, 62, no. 2, 2001, 267
A.A. Razborov, Proceedings 17th IEEE Annual Conference on Computational Complexity, 2002, 29
Trinh Huynh, Jakob Nordstrom, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 233
Michal Garlík, Leszek Aleksander Kołodziejczyk, “Some Subsystems of Constant-Depth Frege with Parity”, ACM Trans. Comput. Logic, 19, no. 4, 2018, 1
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret, “Semialgebraic Proofs, IPS Lower Bounds, and the $\boldsymbol{\tau}$-Conjecture: Can a Natural Number be Negative?”, SIAM J. Comput., 53, no. 3, 2024, 648
Mladen Mikša, Jakob Nordström, “A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds”, J. ACM, 2024, 3675668
Eitetsu Ken, “On some $\Sigma ^{B}_{0}$-formulae generalizing counting principles over $V^{0}$”, Arch. Math. Logic, 2024
Julian Romero, Levent Tunçel, “Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz”, SIAM J. Discrete Math., 38, no. 3, 2024, 2108
Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 1405
Ilario Bonacina, Maria Luisa Bonet, Jordi Levy, “Polynomial calculus for optimization”, Artificial Intelligence, 337, 2024, 104208