2012 IEEE 27th Conference on Computational Complexity (2011)
San Jose, California USA
June 8, 2011 to June 11, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2011.34
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.
P vs. NP, average-case complexity, oracles, relativization, heuristica
Russell Impagliazzo, "Relativized Separations of Worst-Case and Average-Case Complexities for NP", 2012 IEEE 27th Conference on Computational Complexity, vol. 00, no. , pp. 104-114, 2011, doi:10.1109/CCC.2011.34