Result: Tuples of disjoint NP-sets

Title:
Tuples of disjoint NP-sets
Authors:
BEYERSDORFF, Olaf
Source:
Computer science (theory and applications)0CSR 2006. :80-91
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 19 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Cryptographie, Cryptography, Criptografía, Problème NP complet, NP complete problem, Problema NP completo, Théorie preuve, Proof theory, Teoría demonstración, Vérification programme, Program verification, Verificación programa
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institut for Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150237
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Telecommunications and information theory
Accession Number:
edscal.19150237
Database:
PASCAL Archive

Further Information

Disjoint NP-pairs are a well studied complexity theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint NP-pairs to disjoint k-tuples of NP-sets for k > 2. We define subclasses of the class of all disjoint k-tuples of NP-sets. These subclasses are associated with a propositional proof system and possess complete tuples which are defined from the proof system. In our main result we show that complete disjoint NP-pairs exist if and only if complete disjoint k-tuples of NP-sets exist for all k ≥ 2. Further, this is equivalent to the existence of a propositional proof system in which the disjointness of all k-tuples is shortly provable. We also show that a strengthening of this conditions characterizes the existence of optimal proof systems.