Trinh Huynh, Jakob Nordstrom, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 233
Joshua A. Grochow, Toniann Pitassi, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014, 110
Ilario Bonacina, Nicola Galesi, “A Framework for Space Complexity in Algebraic Proof Systems”, J. ACM, 62, № 3, 2015, 1
Massimo Lauria, Neil Thapen, “On semantic cutting planes with very small coefficients”, Information Processing Letters, 136, 2018, 70
Dmitry Itsykson, Dmitry Sokolov, “Resolution over linear equations modulo two”, Annals of Pure and Applied Logic, 171, № 1, 2020, 102722
Albert Atserias, Joanna Ochremiak, “Proof Complexity Meets Algebra”, ACM Trans. Comput. Logic, 20, № 1, 2019, 1
Susanna F. De Rezende, Or Meir, Jakob Nordström, Robert Robere, “Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling”, comput. complex., 30, № 1, 2021, 4
Ilario Bonacina, Nicola Galesi, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013, 455
Eli Ben-Sasson, “Size-Space Tradeoffs for Resolution”, SIAM J. Comput., 38, № 6, 2009, 2511
Jakob Nordström, Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006, 507