Forbes M.A., Shpilka A., Tzameret I., Wigderson A., “Proof Complexity Lower Bounds From Algebraic Circuit Complexity”, Theory Comput., 17:SI (2021), 10
Sokolov D., “(Semi)Algebraic Proofs Over (+/- 1) Variables”, Proceedings of the 52Nd Annual Acm Sigact Symposium on Theory of Computing (Stoc `20), Annual Acm Symposium on Theory of Computing, eds. Makarychev K., Makarychev Y., Tulsiani M., Kamath G., Chuzhoy J., Assoc Computing Machinery, 2020, 78–90
Atserias A., Ochremiak J., “Proof Complexity Meets Algebra”, ACM Trans. Comput. Log., 20:1 (2019), 1
Filmus Yu., “Another Look At Degree Lower Bounds For Polynomial Calculus”, Theor. Comput. Sci., 796 (2019), 286–293
Razborov A., “On the Width of Semialgebraic Proofs and Algorithms”, Math. Oper. Res., 42:4 (2017), 1106–1134
Atserias A., Lauria M., Nordstrom J., “Narrow Proofs May Be Maximally Long”, ACM Trans. Comput. Log., 17:3 (2016), 19
Bonacina I., Galesi N., “a Framework For Space Complexity in Algebraic Proof Systems”, J. ACM, 62:3 (2015), 23
Filmus Yu., Lauria M., Nordstrom J., Ron-Zewi N., Thapen N., “Space Complexity in Polynomial Calculus”, SIAM J. Comput., 44:4 (2015), 1119–1153
Atserias A., Lauria M., Nordstrom J., “Narrow Proofs May Be Maximally Long”, 2014 IEEE 29Th Conference on Computational Complexity (Ccc), IEEE Conference on Computational Complexity, IEEE, 2014, 286–297
Nordstrom J., “a (Biased) Proof Complexity Survey For Sat Practitioners”, Theory and Applications of Satisfiability Testing - Sat 2014, Lecture Notes in Computer Science, 8561, eds. Sinz C., Egly U., Springer-Verlag Berlin, 2014, 1–6