Ludmila Glinskih, Dmitry Itsykson. Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. In Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, editors, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. Volume 83 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{GlinskihI17,
title = {Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs},
author = {Ludmila Glinskih and Dmitry Itsykson},
year = {2017},
doi = {10.4230/LIPIcs.MFCS.2017.26},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.26},
researchr = {https://researchr.org/publication/GlinskihI17},
cites = {0},
citedby = {0},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-François Raskin},
volume = {83},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-046-0},
}