Reasons for Hardness in QBF Proof Systems

Beyersdorff, O orcid.org/0000-0002-2870-1648, Hinde, L and Pich, J (2018) Reasons for Hardness in QBF Proof Systems. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). 37th IARCS Annual Conference (FSTTCS 2017), 11-15 Dec 2017, Kanpur, India. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 14:1-14:15. ISBN 978-3-95977-055-2

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: (c) Olaf Beyersdorff, Luke Hinde, and Ján Pich; licensed under Creative Commons License CC-BY. (https://creativecommons.org/licenses/by/3.0/)
Keywords: proof complexity; quantified Boolean formulas; resolution; lower bounds
Dates:
  • Accepted: 30 September 2017
  • Published (online): 26 January 2018
  • Published: 26 January 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 - DO NOT USE48138
Depositing User: Symplectic Publications
Date Deposited: 01 Nov 2017 17:03
Last Modified: 23 Jun 2023 22:38
Status: Published
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
Identification Number: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.14

Export

Statistics