Nachum Dershowitz, Iddo Tzameret, “Complexity of propositional proofs under a promise”, ACM Trans. Comput. Logic, 11, no. 3, 2010, 1
Jan Krajíček, “Randomized feasible interpolation and monotone circuits with a local oracle”, J. Math. Log., 18, no. 02, 2018, 1850012
Nicola Galesi, Massimo Lauria, “Optimality of size-degree tradeoffs for polynomial calculus”, ACM Trans. Comput. Logic, 12, no. 1, 2010, 1
Susanna F. de Rezende, “Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard”, Procedia Computer Science, 195, 2021, 152
Dmitry Sokolov, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 78
Olaf Beyersdorff, Oliver Kutz, 7388, Lectures on Logic and Computation, 2012, 1
Olaf Beyersdorff, 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009, 282
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson, “Spanoids—An Abstraction of Spanning Structures, and a Barrier for LCCs”, SIAM J. Comput., 49, no. 3, 2020, 465
Olaf Beyersdorff, 6108, Theory and Applications of Models of Computation, 2010, 15
Dmitry Sokolov, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 2008