| Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs L Glinskih, D Itsykson 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017 | 15 | 2017 |
| On Tseitin formulas, read-once branching programs and treewidth L Glinskih, D Itsykson Computer Science–Theory and Applications: 14th International Computer …, 2019 | 13 | 2019 |
| The complexity of verifying boolean programs as differentially private M Bun, M Gaboardi, L Glinskih 2022 IEEE 35th Computer Security Foundations Symposium (CSF), 396-411, 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 |
| Partial Minimum Branching Program Size Problem is ETH-hard L Glinskih, A Riazanov arXiv preprint arXiv:2407.04632, 2024 | | 2024 |
| Complexity of read-once branching programs for satisfiable and unsatisfiable Tseitin formulas L Glinskih, D Itsykson, A Riazanov, P Smirnov | | |
Artur RiazanovEPFL在 epfl.ch 的电子邮件经过验证
Artur RiazanovEPFL在 epfl.ch 的电子邮件经过验证
Mark BunAssistant Professor, Boston University在 bu.edu 的电子邮件经过验证
Marco GaboardiBoston University在 bu.edu 的电子邮件经过验证