Are Short Proofs Narrow? QBF Resolution is not so Simple

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2018) Are Short Proofs Narrow? QBF Resolution is not so Simple. ACM Transactions on Computational Logic, 19 (1). 1. ISSN 1529-3785

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2017, the authors. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Computational Logic (TOCL), 19 (1), January 2018, http://doi.acm.org/0.1145/3157053. Uploaded in accordance with the publisher's self-archiving policy.

Keywords: Algorithms, Theory, Proof complexity, QBF, resolution, lower bound techniques, simulations
Dates:
  • Published: January 2018
  • Published (online): 6 January 2018
  • Accepted: 26 October 2017
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
Funder
Grant number
EPSRC
EP/L024233/1
John Templeton Foundation - DO NOT USE
48138
EU - European Union
612638
Depositing User: Symplectic Publications
Date Deposited: 01 Nov 2017 16:54
Last Modified: 24 Jan 2018 22:03
Status: Published
Publisher: Association for Computing Machinery (ACM)
Identification Number: 10.1145/3157053
Open Archives Initiative ID (OAI ID):

Export

Statistics