Advertisement

Complexity hierarchies of oracles

  • Klaus Wagner
  • Gerd Wechsung
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chodshajev, D. On the complexity of computation on Turing machines with oracle (russian), Voprosij Kibernetiki i vijchislitjelnoi matematiki, 12 (1967), 69–76 Tashkent.Google Scholar
  2. 2.
    Chodshajev,D. Independent predicates and relative computations of the predicate of symmetry (russian), Voprosij Kibernetiki i vijchislitjelnoi matematiki, 33 (1969), Tashkent.Google Scholar
  3. 3.
    Enderton, H. Degrees of computational complexity.JCSS 6 (1972) 389–396.Google Scholar
  4. 4.
    Lynch,N.A., Meyer,A.R., Fischer,M.J., Relativization of the theory of computational complexity, MIT Project MAC TR — 99, 1972.Google Scholar
  5. 5.
    Mäurer,E., Ein Vergleich zwischen Orakelmengen zur Entscheidung einer festen Menge, Diploma thesis, University of Jena, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Klaus Wagner
    • 1
  • Gerd Wechsung
    • 1
  1. 1.Section of MathematicsFriedrich Schiller UniversityJenaGDR

Personalised recommendations