@InProceedings{mertz_et_al:LIPIcs.ICALP.2019.84,
author = {Mertz, Ian and Pitassi, Toniann and Wei, Yuanhao},
title = {{Short Proofs Are Hard to Find}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {84:1--84:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.84},
URN = {urn:nbn:de:0030-drops-106605},
doi = {10.4230/LIPIcs.ICALP.2019.84},
annote = {Keywords: automatizability, Resolution, SAT solvers, proof complexity}
}