@InProceedings{galesi_et_al:LIPIcs.MFCS.2019.49,
author = {Galesi, Nicola and Itsykson, Dmitry and Riazanov, Artur and Sofronova, Anastasia},
title = {{Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {49:1--49:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.49},
URN = {urn:nbn:de:0030-drops-109932},
doi = {10.4230/LIPIcs.MFCS.2019.49},
annote = {Keywords: Tseitin formula, treewidth, AC0-Frege}
}