A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Lower bounds on random-self-reducibility
Proceedings Fifth Annual Structure in Complexity Theory Conference
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, zeroknowledge, instance-hiding, program-checking, and program-testing. Several examples of random-selfreductions are quite well-known and have been applied in all of
doi:10.1109/sct.1990.113959
dblp:conf/coco/FeigenbaumKN90
fatcat:vwerkcayyvec5g5npfebebkg2a