Bounded-depth Frege complexity of Tseitin formulas for all graphs N Galesi, D Itsykson, A Riazanov, A Sofronova Annals of Pure and Applied Logic 174 (1), 103166, 2023 | 16* | 2023 |
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs D Itsykson, A Riazanov, D Sagunov, P Smirnov computational complexity 30 (2), 13, 2021 | 9* | 2021 |
Proof complexity of natural formulas via communication arguments D Itsykson, A Riazanov 36th Computational Complexity Conference (CCC 2021), 2021 | 5 | 2021 |
Sampling and certifying symmetric functions Y Filmus, I Leigh, A Riazanov, D Sokolov arXiv preprint arXiv:2305.04363, 2023 | 4 | 2023 |
Irreducible subcube partitions Y Filmus, E Hirsch, S Kurz, F Ihringer, A Riazanov, A Smal, M Vinyals arXiv preprint arXiv:2212.14685, 2022 | 4 | 2022 |
Lower bounds on OBDD proofs with several orders S Buss, D Itsykson, A Knop, A Riazanov, D Sokolov ACM Transactions on Computational Logic (TOCL) 22 (4), 1-30, 2021 | 4 | 2021 |
Proving unsatisfiability with hitting formulas Y Filmus, EA Hirsch, A Riazanov, A Smal, M Vinyals arXiv preprint arXiv:2302.06241, 2023 | 3 | 2023 |
Automating OBDD proofs is NP-hard D Itsykson, A Riazanov 47th International Symposium on Mathematical Foundations of Computer Science …, 2022 | 3 | 2022 |
Tight Bounds for Tseitin Formulas D Itsykson, A Riazanov, P Smirnov 25th International Conference on Theory and Applications of Satisfiability …, 2022 | 3 | 2022 |
MCSP is hard for read-once nondeterministic branching programs L Glinskih, A Riazanov Latin American Symposium on Theoretical Informatics, 626-640, 2022 | 1 | 2022 |
Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space S Gryaznov, S Ovcharov, A Riazanov arXiv preprint arXiv:2404.08370, 2024 | | 2024 |
Top-Down Lower Bounds for Depth-Four Circuits M Göös, A Riazanov, A Sofronova, D Sokolov 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | | 2023 |
On the decision trees with symmetries A Riazanov International Computer Science Symposium in Russia, 282-294, 2018 | | 2018 |
THL5 M Göös, NI Harms, A Hollender, GT Maystre, A Riazanov, A Sofronova, ... | | |