Preview
Unable to display preview. Download preview PDF.
References
Chodshajev, D. On the complexity of computation on Turing machines with oracle (russian), Voprosij Kibernetiki i vijchislitjelnoi matematiki, 12 (1967), 69–76 Tashkent.
Chodshajev,D. Independent predicates and relative computations of the predicate of symmetry (russian), Voprosij Kibernetiki i vijchislitjelnoi matematiki, 33 (1969), Tashkent.
Enderton, H. Degrees of computational complexity.JCSS 6 (1972) 389–396.
Lynch,N.A., Meyer,A.R., Fischer,M.J., Relativization of the theory of computational complexity, MIT Project MAC TR — 99, 1972.
Mäurer,E., Ein Vergleich zwischen Orakelmengen zur Entscheidung einer festen Menge, Diploma thesis, University of Jena, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, K., Wechsung, G. (1977). Complexity hierarchies of oracles. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_178
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive