Inseparability and Strong Hypotheses for Disjoint NP Pairs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Inseparability and Strong Hypotheses for Disjoint NP Pairs

Abstract

This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs of NP languages that are P-inseparable, in fact TIME(2^(n^k))-inseparable. We also relate these conditions to strong hypotheses concerning randomness and genericity of disjoint pairs.
Fichier principal
Vignette du fichier
fortnow.pdf (200.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00455362 , version 1 (10-02-2010)

Identifiers

  • HAL Id : inria-00455362 , version 1

Cite

Lance Fortnow, Jack H. Lutz, Elvira Mayordomo. Inseparability and Strong Hypotheses for Disjoint NP Pairs. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.395-404. ⟨inria-00455362⟩

Collections

STACS2010
44 View
94 Download

Share

Gmail Facebook X LinkedIn More