Lower bounds: from circuits to QBF proof systems

Beyersdorff, O, Bonacina, I and Chew, L (2016) Lower bounds: from circuits to QBF proof systems. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ITCS '16, 14-16 Jan 2016, Cambridge, Massachusetts, USA. ACM , pp. 249-260. ISBN 978-1-4503-4057-1

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Bonacina, I
  • Chew, L
Copyright, Publisher and Additional Information: © ACM, 2016. 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 Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 978-1-4503-4057-1, http://doi.acm.org/10.1145/2840728.2840740.
Keywords: QBF proof complexity; Frege systems; proof complexity; circuit complexity
Dates:
  • Published: 14 January 2016
  • Accepted: 20 October 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: 03 Nov 2015 16:40
Last Modified: 27 May 2016 04:31
Published Version: http://dx.doi.org/10.1145/2840728.2840740
Status: Published
Publisher: ACM
Identification Number: https://doi.org/10.1145/2840728.2840740

Share / Export

Statistics