Nicola Galesi, Neil Thapen, 3569, Theory and Applications of Satisfiability Testing, 2005, 76
Ran Raz, Iddo Tzameret, “Resolution over linear equations and multilinear proofs”, Annals of Pure and Applied Logic, 155, no. 3, 2008, 194
Theodoros Papamakarios, Alexander Razborov, “Space characterizations of complexity measures and size-space trade-offs in propositional proof systems”, Journal of Computer and System Sciences, 137, 2023, 20
Gaurav Jindal, Neelam Sharma, Harshita Chadha, Nitish Pathak, 2021 9th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO), 2021, 1
Chris Beck, Jakob Nordstrom, Bangsheng Tang, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 813
Jakob Nordström, “On the interplay between proof complexity and SAT solving”, ACM SIGLOG News, 2, no. 3, 2015, 19
Jan Krajíček, Proof Complexity, 2019
Iddo Tzameret, “Algebraic proofs over noncommutative formulas”, Information and Computation, 209, no. 10, 2011, 1269
Jonas Conneryd, Susanna F. De Rezende, Jakob Nordström, Shuo Pang, Kilian Risse, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 1
Albert Atserias, “On sufficient conditions for unsatisfiability of random formulas”, J. ACM, 51, no. 2, 2004, 281