Dominik Scheder. Unsatisfiable Linear CNF Formulas Are Large and Complex. In Jean-Yves Marion, Thomas Schwentick, editors, 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. Volume 5 of LIPIcs, pages 621-632, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. [doi]
@inproceedings{Scheder10, title = {Unsatisfiable Linear CNF Formulas Are Large and Complex}, author = {Dominik Scheder}, year = {2010}, doi = {10.4230/LIPIcs.STACS.2010.2490}, url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2490}, researchr = {https://researchr.org/publication/Scheder10}, cites = {0}, citedby = {0}, pages = {621-632}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France}, editor = {Jean-Yves Marion and Thomas Schwentick}, volume = {5}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-939897-16-3}, }