Genuine Lower Bounds for QBF Expansion

Beyersdorff, O orcid.org/0000-0002-2870-1648 and Blinkhorn, J (2018) Genuine Lower Bounds for QBF Expansion. In: Niedermeier, R and Vallee, B, (eds.) Leibniz International Proceedings in Informatics (LIPIcs). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 28 Feb - 03 Mar 2018, Caen, France. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 12:1-12:15. ISBN 978-3-95977-062-0

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: (c) Olaf Beyersdorff and Joshua Blinkhorn; licensed under Creative Commons License CC-BY
Keywords: QBF, proof complexity, lower-bound techniques, resolution
Dates:
  • Accepted: 11 December 2017
  • Published: 2018
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
John Templeton Foundation (US)60842
Depositing User: Symplectic Publications
Date Deposited: 03 Jan 2018 12:38
Last Modified: 23 Jun 2023 22:41
Published Version: https://stacs2018.sciencesconf.org/resource/page/i...
Status: Published
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
Identification Number: https://doi.org/10.4230/LIPIcs.STACS.2018.12

Export

Statistics