On the existence of complete disjoint NP-pairs

Beyersdorff, O (2009) On the existence of complete disjoint NP-pairs. In: SYNASC 2009 - 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. 11th International Symposium on Symbolic & Numeric Algorithms for Scientific Computing, 26-29 September 2009, Timisoara, Romania. IEEE , 282 - 289 . ISBN 978-1-4244-5910-0

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
Copyright, Publisher and Additional Information: © 2009 IEEE. This is an author produced version of a paper published in SYNASC 2009. Uploaded in accordance with the publisher's self-archiving policy. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
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 16:40
Last Modified: 17 Sep 2016 12:49
Published Version: http://dx.doi.org/10.1109/SYNASC.2009.9
Status: Published
Publisher: IEEE
Identification Number: 10.1109/SYNASC.2009.9

Download

Filename: SYNASC09-complete-pairs.pdf

Share / Export

Statistics