Fedor Part, Neil Thapen, Iddo Tzameret, “First-order reasoning and efficient semi-algebraic proofs”, Annals of Pure and Applied Logic, 176:1 (2025), 103496
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:3 (2024), 648
Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh, “Combining data and theory for derivable scientific discovery with AI-Descartes”, Nat Commun, 14:1 (2023)
Yaroslav Alekseev, Edward A. Hirsch, Lecture Notes in Computer Science, 13898, Algorithms and Complexity, 2023, 21
Buss S., Itsykson D., Knop A., Riazanov A., Sokolov D., “Lower Bounds on Obdd Proofs With Several Orders”, ACM Trans. Comput. Log., 22:4 (2021), 26
Fedor Part, Neil Thapen, Iddo Tzameret, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, 1
Monaldo Mastrolilli, “High Degree Sum of Squares Proofs, Bienstock–Zuckerberg Hierarchy, and Chvátal–Gomory Cuts”, SIAM J. Optim., 30:1 (2020), 798
Dmitry Sokolov, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 78
Atserias A., Ochremiak J., “Proof Complexity Meets Algebra”, ACM Trans. Comput. Log., 20:1 (2019), 1
Fawzi A., Malinowski M., Fawzi H., Fawzi O., Advances in Neural Information Processing Systems 32 (Nips 2019), Advances in Neural Information Processing Systems, 32, eds. Wallach H., Larochelle H., Beygelzimer A., d'Alche-Buc F., Fox E., Garnett R., Neural Information Processing Systems (Nips), 2019