On Tseitin formulas, read-once branching programs and treewidth
From MaRDI portal
Publication:2330557
DOI10.1007/978-3-030-19955-5_13OpenAlexW2920044120MaRDI QIDQ2330557
Ludmila Glinskih, Dmitry Itsykson
Publication date: 22 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_13
Related Items (3)
On tseitin formulas, read-once branching programs and treewidth ⋮ Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs ⋮ Bounded-depth Frege complexity of Tseitin formulas for all graphs
This page was built for publication: On Tseitin formulas, read-once branching programs and treewidth
