Are Short Proofs Narrow? QBF Resolution is not Simple.

Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2016) Are Short Proofs Narrow? QBF Resolution is not Simple. In: Ollinger, N and Vollmer, H, (eds.) 33rd Symposium on Theoretical Aspects of Computer Science (STACS'16). Symposium on Theoretical Aspects of Computer Science (STACS'16), 17-20 Feb 2016, Orleans, France. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-001-9

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Chew, L
  • Mahajan, M
  • Shukla, A
Copyright, Publisher and Additional Information: © 2015, Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla; licensed under Creative Commons License CC-BY
Keywords: Proof complexity; QBF; resolution; lower bound techniques
Dates:
  • Published: February 2016
  • Accepted: 4 December 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)
Funding Information:
FunderGrant number
EPSRCEP/L024233/1
John Templeton Foundation - DO NOT USE48138
Depositing User: Symplectic Publications
Date Deposited: 10 Dec 2015 14:53
Last Modified: 10 Mar 2016 08:20
Published Version: http://dx.doi.org/10.4230/LIPIcs.STACS.2016.15
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Identification Number: https://doi.org/10.4230/LIPIcs.STACS.2016.15

Share / Export

Statistics