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
Abstract
For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P). Moreover we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
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 |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (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: | 19 Dec 2022 13:24 |
Published Version: | http://dx.doi.org/10.1007/11750321_23 |
Status: | Published |
Publisher: | Springer Verlag |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/11750321_23 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:74799 |