Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. Are Short Proofs Narrow? QBF Resolution is not Simple. In Nicolas Ollinger, Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. Volume 47 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
Abstract is missing.