Parameterized Bounded-Depth Frege Is not Optimal

Beyersdorff, O, Galesi, N, Lauria, M et al. (1 more author) (2012) Parameterized Bounded-Depth Frege Is not Optimal. ACM Transactions on Computation Theory, 4 (3). 7.1 - 7.16 . ISSN 1942-3454

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Galesi, N
  • Lauria, M
  • Razborov, AA
Copyright, Publisher and Additional Information: © 2012, Association for Computing Machinery. This is an author produced version of a paper published in ACM Transactions on Computation Theory. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Algorithms, Theory, Proof complexity, Parameterized complexity, Resolution, bounded-depth Frege
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)
Depositing User: Symplectic Publications
Date Deposited: 03 Dec 2012 09:55
Last Modified: 16 Nov 2016 04:58
Published Version: http://dx.doi.org/10.1145/2355580.2355582
Status: Published
Publisher: Association for Computing Machinery
Identification Number: https://doi.org/10.1145/2355580.2355582

Download

Filename: parres-full-version.pdf

Share / Export

Statistics