Abstract
Relationships between adaptive and nonadaptive random-self-reductions are examined. The question of what happens to random-self-reductions if the number of queries they are allowed to make is restricted is also explored. The following results are shown. (1) There exist sets that are adaptively random-self-reducible but not nonadaptively random-self-reducible. Under reasonable assumptions, there exist such sets in NP. (2) There exists a function that has a nonadaptive (k+1)-random-self-reduction but does not have an adaptive k-random-self-reduction. (3) For any countable class of functions C and any unbounded function k(n), there exists a function that is nonadaptively k-uniformly-random-self-reducible but is not in C/poly. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
