Proof complexity of resolution-based QBF calculi

Beyersdorff, O, Chew, L and Janota, M (2015) Proof complexity of resolution-based QBF calculi. In: LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15). 32nd International Symposium on Theoretical Aspects of Computer Science, 04 Mar 2015 Schloss Dagstuhl - Leibniz International Proceedings in Informatics , 76 - 89. ISBN 9783939897781

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Chew, L
  • Janota, M
Copyright, Publisher and Additional Information: © 2015, Olaf Beyersdorff, Leroy Chew, and Mikoláš Janota; licensed under Creative Commons License CC-BY.
Keywords: Lower bound techniques; Proof complexity; QBF; Separations
Dates:
  • Published: 1 February 2015
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 26 Oct 2015 11:49
Last Modified: 26 Oct 2015 11:49
Published Version: http://dx.doi.org/10.4230/LIPIcs.STACS.2015.76
Status: Published
Publisher: Schloss Dagstuhl - Leibniz International Proceedings in Informatics
Identification Number: https://doi.org/10.4230/LIPIcs.STACS.2015.76

Share / Export

Statistics