Ludmila Glinskih
From MaRDI portal
Person:2043883
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| MCSP is hard for read-once nondeterministic branching programs LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| On Tseitin formulas, read-once branching programs and treewidth Theory of Computing Systems | 2021-08-03 | Paper |
| Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs | 2020-05-26 | Paper |
| On Tseitin formulas, read-once branching programs and treewidth | 2019-10-22 | Paper |
Research outcomes over time
This page was built for person: Ludmila Glinskih
