A theoretical study on the time analysis of programs

  • Akeo Adachi
  • Takumi Kasai
  • Etsuro Moriya
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Meyer, A.R. and D.M.Ritchie, The complexity of loop programs. Proc. 22nd ACM National Meeting (1967), 465–469.Google Scholar
  2. 2.
    Meyer, A.R. and D.M.Ritchie, Computational complexity and program structures. IBM research paper RC-1817, Watson Research Center, 1967.Google Scholar
  3. 3.
    Kalmár, L., Egyszerü példa eldönthetetlen aritmetikai problémára. Matematikai és Fizikai Lapok 50 (1943), 1–23.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Brainerd, W.S. and L.H. Landweber, Theory of Computation. Wiley, New York, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Akeo Adachi
    • 1
  • Takumi Kasai
    • 2
  • Etsuro Moriya
    • 3
  1. 1.Department of Academic and Scientific ProgramsIBM Japan RoppongiMinato-ku, TokyoJapan
  2. 2.IBM Thomas J. Watson Research CenterYorktown HeightsU.S.A.
  3. 3.Department of MathematicsTokyo Woman's Christian UniversityTokyoJapan

Personalised recommendations