Highly Influenced

# Lower Bounds on Random-Self-Reducibility

@inproceedings{Feigenbaum1990LowerBO, title={Lower Bounds on Random-Self-Reducibility}, author={Joan Feigenbaum and Sampath Kannan and Noam Nisan}, booktitle={Structure in Complexity Theory Conference}, year={1990} }

- Published 1990 in Structure in Complexity Theory Conference
DOI:10.1109/SCT.1990.113959

Informally speaking, a function f is random-self-reducible if, for any x, the computation of f(x) can be reduced to the computation of f on other \randomly chosen" inputs. Such functions are fundamental in many areas of theoretical computer science, including lower bounds, pseudorandom number-generators, interactive proof systems, zero-knowledge, instance-hiding, program-checking, and program-testing. Several examples of random-self-reductions are quite well-known and have been applied in allâ€¦Â CONTINUE READING