Unsatisfiable Linear CNF Formulas Are Large and Complex

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]

Abstract

Abstract is missing.