@InProceedings{buss_et_al:LIPIcs.CCC.2018.16,
author = {Buss, Sam and Itsykson, Dmitry and Knop, Alexander and Sokolov, Dmitry},
title = {{Reordering Rule Makes OBDD Proof Systems Stronger}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {16:1--16:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.16},
URN = {urn:nbn:de:0030-drops-88720},
doi = {10.4230/LIPIcs.CCC.2018.16},
annote = {Keywords: Proof complexity, OBDD, Tseitin formulas, the Clique-Coloring principle, lifting theorems}
}