Lower bounds on random-self-reducibility

Joan Feigenbaum*, Sampath Kannan, Noam Nisan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations


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.

Original languageAmerican English
Title of host publicationProc Fifth Annu Struct Complexity Theor
PublisherPubl by IEEE
Number of pages10
ISBN (Print)0818620722
StatePublished - 1990
Externally publishedYes
EventProceedings of the Fifth Annual Structure in Complexity Theory Conference - Barcelona, Spain
Duration: 8 Jul 199011 Jul 1990

Publication series

NameProc Fifth Annu Struct Complexity Theor


ConferenceProceedings of the Fifth Annual Structure in Complexity Theory Conference
CityBarcelona, Spain


Dive into the research topics of 'Lower bounds on random-self-reducibility'. Together they form a unique fingerprint.

Cite this