Searching for "Self-Reducibility." – sorted by Relevance.
-
Graded Self-Reducibility
- Graded Self-Reducibility Mitsunori Ogihara 1 University of Rochester Kenneth W. Regan 2
- Add To MetaCart
-
On the Random-Self-Reducibility . . .
- If S is complete for PP or for MODmP, for any m ? 1, then S is adaptively k(n)-random- self-reducible, for some
- Add To MetaCart
-
Strong Self-Reducibility Precludes Strong Immunity
- Strong Self-Reducibility Precludes Strong Immunity Lane A. Hemaspaandra and Marius Zimand
- Cited by 4 (3 self) – Add To MetaCart
-
Amplifying lower bounds by means of self-reducibility
- Amplifying Lower Bounds by Means of Self-Reducibility Eric Allender ∗ Michal Kouck´y † December 2
- Cited by 1 (1 self) – Add To MetaCart
-
Selectivity and Self-Reducibility: New Characterizations of Complexity Classes
- Proc. ICCI'94, 371-384 1994 Int. Conf. on Computing and Information Selectivity and Self-Reducibility
- Cited by 4 (0 self) – Add To MetaCart
-
On The Random-Self-Reducibility Of Complete Sets
- , and S is nonadaptively k(n)-random- self-reducible, for any polynomially bounded function k, then the polynomialtime
- Cited by 54 (14 self) – Add To MetaCart
-
Space-Efficient Recognition Of Sparse Self-Reducible Languages
- SPACE-EFFICIENT RECOGNITION OF SPARSE SELF-REDUCIBLE LANGUAGES Lane A. Hemaspaandra, Mitsunori
- Cited by 4 (3 self) – Add To MetaCart
-
On Coherence, Random-Self-Reducibility, and Self-Correction
- Laplante and Ashish Naik Abstract. We study three types of self-reducibility that are motivated
- Cited by 9 (7 self) – Add To MetaCart
-
Stronger Separations for Random-Self-Reducibility, Rounds, and Advice
- Paris-Sud 91405 Orsay, France laplante@(email omitted); Abstract A function f is self-reducible if it can
- Cited by 2 (2 self) – Add To MetaCart
-
An Information-Theoretic Treatment of Random-Self-Reducibility
- An Information-Theoretic Treatment of Random-Self-Reducibility Joan Feigenbaum AT&T Labs Murray
- Cited by 1 (1 self) – Add To MetaCart

