Randomizing Reductions of Search Problems

This paper closes a gap in the foundations of the theory of average-case complexity. First, it clarifies the notion of a feasible solution for a search problem and proves its robustness. Second, it gives a general and usable notion of many–one randomizing reductions of search problems and proves that it has desirable properties. All reductions of search problems to search problems in the literature on average-case complexity can be viewed as such many–one randomizing reductions, including those reductions in the literature that use iterations and therefore do not look many–one. As an illustration, this paper presents a careful proof of a theorem of Impagliazzo and Levin in the framework of the present work.

[1]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[2]  Saharon Shelah,et al.  Expected Computation Time for Hamiltonian Path Problem , 1987, SIAM J. Comput..

[3]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[4]  Yuri Gurevich,et al.  Average Case Complexity ∗ , 1998 .

[5]  Andreas Blass,et al.  On the Reduction Theory for Average Case Complexity , 1990, CSL.

[6]  Leonid A. Levin,et al.  No better ways to generate hard NP instances than picking uniformly at random , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Oded Goldreich,et al.  On the theory of average case complexity , 1989, STOC '89.

[8]  Leonid A. Levin,et al.  Random instances of a graph coloring problem are hard , 1988, STOC '88.