@InProceedings{scheder:LIPIcs.STACS.2010.2490,
author = {Scheder, Dominik},
title = {{Unsatisfiable Linear CNF Formulas Are Large and Complex}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {621--632},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
year = {2010},
volume = {5},
editor = {Marion, Jean-Yves and Schwentick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2490},
URN = {urn:nbn:de:0030-drops-24901},
doi = {10.4230/LIPIcs.STACS.2010.2490},
annote = {Keywords: Extremal combinatorics, proof complexity, probabilistic method}
}