A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

Beyersdorff, O and Mueller, S (2010) A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. ACM Transactions on Computational Logic, 11 (4). ISSN 1529-3785



  • Beyersdorff, O
  • Mueller, S
Keywords: Theory, Karp-Lipton theorem, advice, optimal propositional proof systems, bounded arithmetic, extended Frege
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 18 Jul 2012 13:09
Last Modified: 25 Oct 2016 15:29
Published Version: http://dx.doi.org/10.1145/1805950.1805952
Status: Published
Publisher: Association for Computing Machinery
Identification Number: https://doi.org/10.1145/1805950.1805952

Share / Export