Disjoint NP-pairs from propositional proof systems

Beyersdorff, O (2006) Disjoint NP-pairs from propositional proof systems. In: Cai, J, Cooper, SB and Li, A, (eds.) Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Proceedings. Third International Conference, TAMC, 15-20 May 2006, Bejing, China. Lecture Notes in Computer Science, 3959 . Springer Verlag , 236 - 247 . ISBN 3-540-34021-1



  • Beyersdorff, O
Copyright, Publisher and Additional Information: © 2006, Springer Verlag. This is an author produced version of a paper published in Theory and Applications of Models of Computation. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com
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:18
Last Modified: 18 Sep 2016 13:47
Published Version: http://dx.doi.org/10.1007/11750321_23
Status: Published
Publisher: Springer Verlag
Identification Number: 10.1007/11750321_23


Filename: peking_final.pdf

Share / Export