On the relativization of deterministic and nondeterministic complexity classes

  • M. I. Dekhtyar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Book R., Comparing complexity classes, J. Comp. and Syst. Sci., 1974, 9, 213–229.Google Scholar
  2. 2.
    Trakhtenbrot B.A., On problems solvable by successive trials, Lect. Notes in Computer Sci., 32, 1975, 125–137.Google Scholar
  3. 3.
    Ladner R., Lynch N., Selman A.L., Comparison of polynomial-time reducibilities, Sixth ACM Symp. on Thery of Computing, 1974, 110–121.Google Scholar
  4. 4.
    Savitch W.J., Relationships between nondeterministic and deterministic tape complexities, J.Comp. and Syst. Sci., 1970, 4, 177–192.Google Scholar
  5. 5.
    Cook S.A., A hierachy for nondeterministic time complexity, J.Comp. and Syst. Sci., 1973, 7, 343–352.Google Scholar
  6. 6.
    Valiant L.G., Relate complexity as checing and evaluating, Center of Comput. Studies, University of Lids, 1974.Google Scholar
  7. 7.
    Karp R.M., Reducibility among combinatorial problems, in Complexity of Computer Computations, Miller and Thatcher (eds.),Plenum Press, 1973, 85–103.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • M. I. Dekhtyar
    • 1
  1. 1.Institute of MathematicsSiberian Branch of the USSR Academy of SciencesNovosibirsk

Personalised recommendations