Beyersdorff, O (2004) Representable Disjoint NP-Pairs. In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTITCS 2004, 16 - 18 December 2004, Chennai, India. Springer Verlag , 122 - 134 . ISBN 3-540-24058-6Full text available as:
Available under License : See the attached licence file.
We investigate the class of disjoint NP-pairs under different reductions. The structure of this class is intimately linked to the simulation order of propositional proof systems, and we make use of the relationship between propositional proof systems and theories of bounded arithmetic as the main tool of our analysis. Specifically we exhibit a pair which is complete under strong reductions for all disjoint NP-pairs representable in a theory. We use these pairs to explain the simulation order of NP-pairs under these reductions. As corollaries we also get simplified proofs of results obtained earlier in  and .
|Item Type:||Proceedings Paper|
|Copyright, Publisher and Additional Information:||© 2005, Springer. This is an author produced version of a paper published in Lecture notes in computer science. Uploaded in accordance with the publisher's self-archiving policy|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science|
|Depositing User:||Symplectic Publications|
|Date Deposited:||07 Dec 2012 13:33|
|Last Modified:||08 Feb 2013 17:41|
Actions (login required)