Razborov, Alexander A. Propositional proof complexity. (English) Zbl 07763400 Hujdurović, Ademir (ed.) et al., European congress of mathematics. Proceedings of the 8th congress, 8ECM, Portorož, Slovenia, June 20–26, 2021. Berlin: European Mathematical Society (EMS). 439-464 (2023). MSC: 03F20 68Q17 PDFBibTeX XMLCite \textit{A. A. Razborov}, in: European congress of mathematics. Proceedings of the 8th congress, 8ECM, Portorož, Slovenia, June 20--26, 2021. Berlin: European Mathematical Society (EMS). 439--464 (2023; Zbl 07763400) Full Text: DOI
Papamakarios, Theodoros; Razborov, Alexander Space characterizations of complexity measures and size-space trade-offs in propositional proof systems. (English) Zbl 07709773 J. Comput. Syst. Sci. 137, 20-36 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{T. Papamakarios} and \textit{A. Razborov}, J. Comput. Syst. Sci. 137, 20--36 (2023; Zbl 07709773) Full Text: DOI
Mull, Nathan; Pang, Shuo; Razborov, Alexander On CDCL-based proof systems with the ordered decision strategy. (English) Zbl 1526.68011 SIAM J. Comput. 51, No. 4, 1368-1399 (2022). MSC: 68V15 03F20 68R07 68T20 PDFBibTeX XMLCite \textit{N. Mull} et al., SIAM J. Comput. 51, No. 4, 1368--1399 (2022; Zbl 1526.68011) Full Text: DOI
Razborov, Alexander On space and depth in resolution. (English) Zbl 1522.03322 Comput. Complexity 27, No. 3, 511-559 (2018). MSC: 03F20 68Q17 PDFBibTeX XMLCite \textit{A. Razborov}, Comput. Complexity 27, No. 3, 511--559 (2018; Zbl 1522.03322) Full Text: DOI
Razborov, Alexander A. Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution. (English) Zbl 1376.03055 Ann. Math. (2) 181, No. 2, 415-472 (2015). MSC: 03F20 68Q17 PDFBibTeX XMLCite \textit{A. A. Razborov}, Ann. Math. (2) 181, No. 2, 415--472 (2015; Zbl 1376.03055) Full Text: DOI
Borodin, A.; Pitassi, T.; Razborov, A. Special issue in memory of Misha Alekhnovich. Foreword. (English) Zbl 1241.01030 Comput. Complexity 20, No. 4, 579-590 (2011). MSC: 01A70 PDFBibTeX XMLCite \textit{A. Borodin} et al., Comput. Complexity 20, No. 4, 579--590 (2011; Zbl 1241.01030) Full Text: DOI
Alekhnovich, Michael; Razborov, Alexander Satisfiability, branch-width and Tseitin tautologies. (English) Zbl 1243.68182 Comput. Complexity 20, No. 4, 649-678 (2011). MSC: 68Q17 68Q25 68T15 03F20 PDFBibTeX XMLCite \textit{M. Alekhnovich} and \textit{A. Razborov}, Comput. Complexity 20, No. 4, 649--678 (2011; Zbl 1243.68182) Full Text: DOI
Nordström, Jakob; Razborov, Alexander On minimal unsatisfiability and time-space trade-offs for \(k\)-DNF resolution. (English) Zbl 1334.03057 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 642-653 (2011). MSC: 03F20 68Q17 PDFBibTeX XMLCite \textit{J. Nordström} and \textit{A. Razborov}, Lect. Notes Comput. Sci. 6755, 642--653 (2011; Zbl 1334.03057) Full Text: DOI
Razborov, Alexander A. Resolution lower bounds for perfect matching principles. (English) Zbl 1106.03049 J. Comput. Syst. Sci. 69, No. 1, 3-27 (2004). MSC: 03F20 05C65 05C70 68Q17 PDFBibTeX XMLCite \textit{A. A. Razborov}, J. Comput. Syst. Sci. 69, No. 1, 3--27 (2004; Zbl 1106.03049) Full Text: DOI
Razborov, Alexander A. Resolution lower bounds for the weak functional pigeonhole principle. (English) Zbl 1050.03039 Theor. Comput. Sci. 303, No. 1, 233-243 (2003). Reviewer: Nail Zamov (Kazan) MSC: 03F20 03B35 68T15 PDFBibTeX XMLCite \textit{A. A. Razborov}, Theor. Comput. Sci. 303, No. 1, 233--243 (2003; Zbl 1050.03039) Full Text: DOI