Follow
Petr Smirnov
Petr Smirnov
Unknown affiliation
No verified email
Title
Cited by
Cited by
Year
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
52021
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs.
D Itsykson, A Riazanov, D Sagunov, P Smirnov
Electronic Colloquium on Computational Complexity (ECCC) 26, 178, 2019
42019
Tight Bounds for Tseitin Formulas
D Itsykson, A Riazanov, P Smirnov
25th International Conference on Theory and Applications of Satisfiability …, 2022
22022
Complexity of read-once branching programs for satisfiable and unsatisfiable Tseitin formulas
L Glinskih, D Itsykson, A Riazanov, P Smirnov
The system can't perform the operation now. Try again later.
Articles 1–4