On the Autoreducibility of Functions
- 16 July 2008
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 46 (2) , 222-245
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- The Complexity Theory Companion2002
- Separating Complexity Classes Using AutoreducibilitySIAM Journal on Computing, 2000
- P-Selective Self-Reducible Sets: A New Characterization of PJournal of Computer and System Sciences, 1996
- On different reducibility notions for function classes1994
- Random-Self-Reducibility of Complete SetsSIAM Journal on Computing, 1993
- On being incoherent without being very hardcomputational complexity, 1992
- Complexity classes defined by counting quantifiersJournal of the ACM, 1991
- #P-COMPLETENESS VIA MANY-ONE REDUCTIONSInternational Journal of Foundations of Computer Science, 1991
- Self-reducibilityJournal of Computer and System Sciences, 1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989