TY - GEN

T1 - Lower bounds on random-self-reducibility

AU - Feigenbaum, Joan

AU - Kannan, Sampath

AU - Nisan, Noam

PY - 1990

Y1 - 1990

N2 - The limitations of random-self-reducibility are studied, and several negative results are proved. For example, it is shown unconditionally that random Boolean functions do not have random self-reductions, even of a quite general nature. For several natural, but less general, classes of random self-reductions, it is shown that, unless the polynomial hierarchy collapses, nondeterministic polynomial-time computable functions are not random-self-reducible.

AB - The limitations of random-self-reducibility are studied, and several negative results are proved. For example, it is shown unconditionally that random Boolean functions do not have random self-reductions, even of a quite general nature. For several natural, but less general, classes of random self-reductions, it is shown that, unless the polynomial hierarchy collapses, nondeterministic polynomial-time computable functions are not random-self-reducible.

UR - http://www.scopus.com/inward/record.url?scp=0025686018&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0025686018

SN - 0818620722

T3 - Proc Fifth Annu Struct Complexity Theor

SP - 100

EP - 109

BT - Proc Fifth Annu Struct Complexity Theor

PB - Publ by IEEE

T2 - Proceedings of the Fifth Annual Structure in Complexity Theory Conference

Y2 - 8 July 1990 through 11 July 1990

ER -