Artur Riazanov

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 31

Top Topics

Linear Equations

Randomly Generated Problem Instances

Top Venues

Electron. Colloquium Comput. Complex.

Comput. Complex.

Publications

Ludmila Glinskih, Artur Riazanov
Partial Minimum Branching Program Size Problem is ETH-hard. Electron. Colloquium Comput. Complex. (2024)
Svyatoslav Gryaznov, Sergei Ovcharov, Artur Riazanov
Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space. CoRR (2024)
Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals
Proving Unsatisfiability with Hitting Formulas. ITCS (2024)
Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov
Hardness Condensation by Restriction. STOC (2024)
Ludmila Glinskih, Artur Riazanov
Partial Minimum Branching Program Size Problem is ETH-hard. CoRR (2024)
Ziyi Guan, Artur Riazanov, Weiqiang Yuan
Breaking Verifiable Delay Functions in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2024 (2024)
Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov
Sampling and Certifying Symmetric Functions. APPROX/RANDOM (2023)
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Ann. Pure Appl. Log. 174 (1) (2023)
Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov
Sampling and Certifying Symmetric Functions. Electron. Colloquium Comput. Complex. (2023)
Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals
Proving Unsatisfiability with Hitting Formulas. CoRR (2023)
Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
Top-Down Lower Bounds for Depth-Four Circuits. Electron. Colloquium Comput. Complex. (2023)
Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals
Proving Unsatisfiability with Hitting Formulas. Electron. Colloquium Comput. Complex. (2023)
Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov
Hardness Condensation by Restriction. Electron. Colloquium Comput. Complex. (2023)
Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
Top-Down Lower Bounds for Depth-Four Circuits. CoRR (2023)
Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
Top-Down Lower Bounds for Depth-Four Circuits. FOCS (2023)
Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov
Sampling and Certifying Symmetric Functions. CoRR (2023)
Dmitry Itsykson, Artur Riazanov, Petr Smirnov
Tight Bounds for Tseitin Formulas. SAT (2022)
Dmitry Itsykson, Artur Riazanov
Automating OBDD proofs is NP-hard. Electron. Colloquium Comput. Complex. (2022)
Dmitry Itsykson, Artur Riazanov
Automating OBDD proofs is NP-hard. MFCS (2022)
Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals
Irreducible subcube partitions. CoRR (2022)
Ludmila Glinskih, Artur Riazanov
MCSP is Hard for Read-Once Nondeterministic Branching Programs. LATIN (2022)
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30 (2) (2021)
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov
Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. 22 (4) (2021)
Dmitry Itsykson, Artur Riazanov
Proof Complexity of Natural Formulas via Communication Arguments. Computational Complexity Conference (2021)
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30 (2) (2021)
Dmitry Itsykson, Artur Riazanov
Proof complexity of natural formulas via communication arguments. Electron. Colloquium Comput. Complex. 27 (2020)
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov
Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. 27 (2020)
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. MFCS (2019)
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Artur Riazanov
On the Decision Trees with Symmetries. CSR (2018)