A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

Beyersdorff, O and Mueller, S (2008) A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. In: Kaminiski, M and Martini, S, (eds.) Proceedings of Computer Science Logic. 17th Annual Conference of the EACSL, 16-19 September 2008, Bertinoro, Italy. Lecture Notes in Computer Science, 5213 . Springer Verlag , 199 - 214 . ISBN 978-3-540-87530-7



  • Beyersdorff, O
  • Mueller, S
Copyright, Publisher and Additional Information: © 2008, Springer Verlag. This is an author produced version of a paper published in Proceedings of Computer Science Logic. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: 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) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 10 Dec 2012 12:02
Last Modified: 24 Sep 2016 12:59
Published Version: http://dx.doi.org/10.1007/978-3-540-87531-4_16
Status: Published
Publisher: Springer Verlag
Identification Number: 10.1007/978-3-540-87531-4_16


Filename: advicefinal.pdf

Share / Export