Abstract
It is shown that, for every k≥0 and every fixed algorithmically random language B, there is a language that is polynomialtime, truth-table reducible in k+1 queries to B but not truth-table reducible in k queries in any amount of time to any algorithmically random language C. In particular, this yields the separation Pk-tt(RAND) ⫋ P(k+1)-tt(RAND), where RAND is the set of all algorithmically random languages.
Cite
CITATION STYLE
Book, R. V., Lutz, J. H., & Martin, D. M. (1994). The global power of additional queries to random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 403–414). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_158
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
