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-0Full text available as:
Available under licence : See the attached licence file.
Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. The question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with access to a very weak oracle (a tally NP-oracle). In addition, we exhibit candidates for complete NP-pairs and apply our results to a recent line of research on the construction of hard tautologies from pseudorandom generators.
|Item Type:||Proceedings Paper|
|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:||08 Jun 2014 20:12|