Preview
Unable to display preview. Download preview PDF.
References
Meyer, A.R. and D.M.Ritchie, The complexity of loop programs. Proc. 22nd ACM National Meeting (1967), 465–469.
Meyer, A.R. and D.M.Ritchie, Computational complexity and program structures. IBM research paper RC-1817, Watson Research Center, 1967.
Kalmár, L., Egyszerü példa eldönthetetlen aritmetikai problémára. Matematikai és Fizikai Lapok 50 (1943), 1–23.
Kasai, T. and A.Adachi, A characterization of time complexity by simple loop programs. Technical report RIMS-250, Research Institute for Math. Sci., Kyoto Univ., 1978.
Brainerd, W.S. and L.H. Landweber, Theory of Computation. Wiley, New York, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adachi, A., Kasai, T., Moriya, E. (1979). A theoretical study on the time analysis of programs. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive