Artur Riazanov's homepage

I am a PhD student in St. Petersburg Department of Steklov Mathematical Institute advised by Dmitry Itsykson. My main research area is proof complexity.

My publications

Conference proceedings

Automating OBDD proofs is NP-hard

with Dmitry Itsykson. To appear in proceedings of MFCS 2022. ECCC version.

Tight Bounds for Tseitin Formulas

with Dmitry Itsykson and Petr Smirnov. Accepted to SAT 2022.

Proof complexity of natural formulas via communication arguments

with Dmitry Itsykson. In proceedings of CCC21. ECCC version.

Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs

with Nicola Galesi, Dmitry Itsykson, and Anastasia Sofronova. In proceedings of MFCS19. ECCC version.

On the Decision Trees with Symmetries

In proceedings of CSR18.


Lower Bounds on OBDD Proofs with Several Orders

with Sam Buss, Dmitry Itsykson, Alexander Knop, and Dmitry Sokolov. Accepted to ToCL. ECCC version.

Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

with Dmitry Itsykson, Danil Sagunov, and Petr Smirnov. Computational Complexity. ECCC version.



My email

aariazanov at gmail dot com.

© 2021