Go to the corresponding Portal 
pdfformat: 

@InProceedings{scheder:LIPIcs:2010:2490, author = {Dominik Scheder}, title = {{Unsatisfiable Linear CNF Formulas Are Large and Complex}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {621632}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897163}, ISSN = {18688969}, year = {2010}, volume = {5}, editor = {JeanYves Marion and Thomas Schwentick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2490}, URN = {urn:nbn:de:0030drops24901}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2490}, annote = {Keywords: Extremal combinatorics, proof complexity, probabilistic method} }
Keywords:  Extremal combinatorics, proof complexity, probabilistic method  
Seminar:  27th International Symposium on Theoretical Aspects of Computer Science  
Issue Date:  2010  
Date of publication:  09.03.2010 