Abstract
We prove that, relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to errorless-average-case reductions. In fact, we prove that relative to an oracle, there is no worst-case to errorless-average-case reduction from NP to BPP∥NP. We also handle reductions from NP to the polynomial-time hierarchy and beyond, under strong restrictions on the number of queries the reductions can make.
- Arora, S. and Barak, B. 2009. Computational Complexity: A Modern Approach. Cambridge University Press. Google Scholar
Cross Ref
- Babai, L., Fortnow, L., Nisan, N., and Wigderson, A. 1993. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computat. Complex. 3, 307--318. Google Scholar
Digital Library
- Bennett, C., Bernstein, E., Brassard, G., and Vazirani, U. 1997. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 5, 1510--1523. Google Scholar
Digital Library
- Bogdanov, A. and Trevisan, L. 2006a. Average-case complexity. Found. Trends Theoret. Computer Science 2, 1. Google Scholar
Digital Library
- Bogdanov, A. and Trevisan, L. 2006b. On worst-case to average-case reductions for NP problems. SIAM J. Comput. 36, 4, 1119--1159. Google Scholar
Digital Library
- Feigenbaum, J. and Fortnow, L. 1993. Random-self-reducibility of complete sets. SIAM J. Comput. 22, 5, 994--1005. Google Scholar
Digital Library
- Fortnow, L. 1999. Relativized worlds with an infinite hierarchy. Inf. Proc. Lett. 69, 6, 309--313. Google Scholar
Digital Library
- Furst, M., Saxe, J., and Sipser, M. 1984. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17, 1, 13--27.Google Scholar
- Goldreich, O. 2008. Computational Complexity: A Conceptual Perspective. Cambridge University Press. Google Scholar
Cross Ref
- Gutfreund, D. and Ta-Shma, A. 2007. Worst-case to average-case reductions revisited. In Proceedings of the 11th International Workshop on Randomization and Computation. 569--583. Google Scholar
Digital Library
- Gutfreund, D., Shaltiel, R., and Ta-Shma, A. 2007. If NP languages are hard on the worst-case, then it is easy to find their hard instances. Computat. Complex. 16, 4, 412--441. Google Scholar
Digital Library
- Han, Y., Hemaspaandra, L., and Thierauf, T. 1997. Threshold computation and cryptographic security. SIAM J. Comput. 26, 1, 59--78. Google Scholar
Digital Library
- Impagliazzo, R. 1995. A personal view of average-case complexity. In Proceedings of the 10th IEEE Conference on Structure in Complexity Theory. 134--147. Google Scholar
Digital Library
- Impagliazzo, R. 2011. Relativized separations of worst-case and average-case complexities for NP. In Proceedings of the 26th IEEE Conference on Computational Complexity. 104--114. Google Scholar
Digital Library
- Impagliazzo, R. and Levin, L. 1990. No better ways to generate hard NP instances than picking uniformly at random. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science. 812--821. Google Scholar
Digital Library
- Impagliazzo, R. and Luby, M. 1989. One-way functions are essential for complexity based cryptography. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. 230--235. Google Scholar
Digital Library
- Kerenidis, I. and de Wolf, R. 2004. Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69, 3, 395--420. Google Scholar
Digital Library
- Levin, L. 1986. Average case complete problems. SIAM J. Comput. 15, 1, 285--286. Google Scholar
Digital Library
- Regev, O. 2006. Lattice-based cryptography. In Proceedings of the 26th International Cryptology Conference. 131--141. Google Scholar
Digital Library
- Sudan, M., Trevisan, L., and Vadhan, S. 2001. Pseudorandom generators without the XOR Lemma. J. Comput. Syst. Sci. 62, 2, 236--266. Google Scholar
Digital Library
- Viola, E. 2005a. The complexity of constructing pseudorandom generators from hard functions. Computat. Complex. 13, 3--4, 147--188. Google Scholar
Digital Library
- Viola, E. 2005b. On constructing parallel pseudorandom generators from one-way functions. In Proceedings of the 20th IEEE Conference on Computational Complexity. 183--197. Google Scholar
Digital Library
- Watson, T. 2010. Relativized worlds without worst-case to average-case reductions for NP. Tech. rep. TR10-042, Electronic Colloquium on Computational Complexity.Google Scholar
Index Terms
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
Recommendations
Relativized Separations of Worst-Case and Average-Case Complexities for NP
CCC '11: Proceedings of the 2011 IEEE 26th Annual Conference on Computational ComplexityNon-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 ...
On Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a nonadaptive self-corrector with respect to any samplable distribution, then coNP is contained in NP/poly and the polynomial hierarchy collapses to the third level. Feigenbaum and Fortnow [SIAM J. Comput., 22 (...
Relativized worlds without worst-case to average-case reductions for NP
APPROX/RANDOM'10: Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniquesWe prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to errorless-average-case reductions. In fact, we prove that relative to an ...






Comments