This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 26th Annual IEEE Conference on Computational Complexity
Relativized Separations of Worst-Case and Average-Case Complexities for NP
San Jose, California USA
June 08-June 11
ISBN: 978-0-7695-4411-3
Non-relativization of complexity issues can beinterpreted as showing that these issues cannot be resolvedby "black-box" techniques. We show that the assumptionDistNP is contained in AvgP does not imply that NP =RP byrelativizing techniques. More precisely, we give an oraclerelative to which the assumption holds but the conclusionfails. Moreover, relative to our oracle, there are problems inthe intersection of NP and CoNP that require exponential circuit complexity.We also give an alternate version where DistNP is contained in AvgPis true, but a problem in the second level of the polynomialhierarchy is hard on the uniform distribution.
Index Terms:
P vs. NP, average-case complexity, oracles, relativization, heuristica
Citation:
Russell Impagliazzo, "Relativized Separations of Worst-Case and Average-Case Complexities for NP," ccc, pp.104-114, 2011 26th Annual IEEE Conference on Computational Complexity, 2011
Usage of this product signifies your acceptance of the Terms of Use.