This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Book R., Comparing complexity classes, J. Comp. and Syst. Sci., 1974, 9, 213–229.
Trakhtenbrot B.A., On problems solvable by successive trials, Lect. Notes in Computer Sci., 32, 1975, 125–137.
Ladner R., Lynch N., Selman A.L., Comparison of polynomial-time reducibilities, Sixth ACM Symp. on Thery of Computing, 1974, 110–121.
Savitch W.J., Relationships between nondeterministic and deterministic tape complexities, J.Comp. and Syst. Sci., 1970, 4, 177–192.
Cook S.A., A hierachy for nondeterministic time complexity, J.Comp. and Syst. Sci., 1973, 7, 343–352.
Valiant L.G., Relate complexity as checing and evaluating, Center of Comput. Studies, University of Lids, 1974.
Karp R.M., Reducibility among combinatorial problems, in Complexity of Computer Computations, Miller and Thatcher (eds.),Plenum Press, 1973, 85–103.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dekhtyar, M.I. (1976). On the relativization of deterministic and nondeterministic complexity classes. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_183
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_183
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive