Ludmila Glinskih

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 9

Top Topics

Bounded Treewidth

Propositional Formulas

Read Once Formulas

Top Venues

Electron. Colloquium Comput. Complex.

Theory Comput. Syst.

Publications

Ludmila Glinskih, Artur Riazanov
Partial Minimum Branching Program Size Problem is ETH-hard. Electron. Colloquium Comput. Complex. (2024)
Ludmila Glinskih, Artur Riazanov
Partial Minimum Branching Program Size Problem is ETH-hard. CoRR (2024)
Mark Bun, Marco Gaboardi, Ludmila Glinskih
The Complexity of Verifying Boolean Programs as Differentially Private. CoRR (2023)
Mark Bun, Marco Gaboardi, Ludmila Glinskih
The Complexity of Verifying Boolean Programs as Differentially Private. CSF (2022)
Ludmila Glinskih, Artur Riazanov
MCSP is Hard for Read-Once Nondeterministic Branching Programs. LATIN (2022)
Ludmila Glinskih, Dmitry Itsykson
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. Theory Comput. Syst. 65 (3) (2021)
Ludmila Glinskih, Dmitry Itsykson
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. CSR (2019)
Ludmila Glinskih, Dmitry Itsykson
On Tseitin formulas, read-once branching programs and treewidth. Electron. Colloquium Comput. Complex. 26 (2019)
Ludmila Glinskih, Dmitry Itsykson
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. MFCS (2017)