Verifying proofs in constant depth

Beyersdorff, O, Datta, S, Krebs, A et al. (5 more authors) (2013) Verifying proofs in constant depth. ACM Transactions on Computation Theory (TOCT), 5 (1). 2. ISSN 1942-3454

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Datta, S
  • Krebs, A
  • Mahajan, M
  • Scharfenberger-Fabian, G
  • Sreenivasaiah, K
  • Thomas, M
  • Vollmer, H
Copyright, Publisher and Additional Information: © ACM, 2013. 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 Computation Theory (TOCT), 5, 1, 2, 2013, http://doi.acm.org/10.1145/2462896.2462898
Keywords: Circuit complexity; proof circuits; proof complexity; small depth proofs
Dates:
  • Published: 2013
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: 23 Jun 2014 11:27
Last Modified: 25 Jun 2014 09:54
Published Version: http://dx.doi.org/10.1145/2462896.2462898
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1145/2462896.2462898

Share / Export

Statistics