Classes of representable disjoint NP-pairs

Beyersdorff, O (2007) Classes of representable disjoint NP-pairs. Theoretical Computer Science, 377 (1-3). 93 - 109 . ISSN 0304-3975

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
Copyright, Publisher and Additional Information: © 2007, Elsevier. This is an author produced version of a paper published in Theoretical Computer Science. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: disjoint NP-pairs, propositional proof systems
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: 19 Jul 2012 09:28
Last Modified: 19 Sep 2016 06:19
Published Version: http://dx.doi.org/10.1016/j.tcs.2007.02.005
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.tcs.2007.02.005

Download

Filename: dnpp_tcs_final.pdf

Share / Export

Statistics