Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses

Xiaoyang Gu 1 John M. Hitchcock 2, * Aduri Pavan 3
* Auteur correspondant
1 LinkedIn Corporation
2 Department of Computer Science
3 Department of Computer Science
Abstract : This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits. 2. If there is a problem in coNP that cannot be solved by polynomial-size nondeterministic circuits, then every many-one complete set is complete under length-increasing reductions that are computed by polynomial-size circuits. 3. If there exist a one-way permutation that is secure against subexponential-size circuits and there is a hard tally language in NP intersect coNP, then there is a Turing complete language for NP that is not many-one complete. Our first two results use worst-case hardness hypotheses whereas earlier work that showed similar results relied on average-case or almost-everywhere hardness assumptions. The use of average-case and worst-case hypotheses in the last result is unique as previous results obtaining the same consequence relied on almost-everywhere hardness results.
Keywords : computational complexity NP-completeness
Type de document :
Communication dans un congrès
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.429-440, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/inria-00455731
Contributeur : Publications Loria <>
Soumis le : jeudi 11 février 2010 - 09:28:41
Dernière modification le : vendredi 5 janvier 2018 - 10:24:01
Document(s) archivé(s) le : vendredi 18 juin 2010 - 20:07:43

Fichier

gu.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00455731, version 1

Collections

STACS2010

Citation

Xiaoyang Gu, John M. Hitchcock, Aduri Pavan. Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.429-440, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00455731〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

104

Téléchargements de fichiers

85

Contact


archive-ouverte@inria.fr