메뉴 건너뛰기
Journal of the ACM (JACM)
Volumn 26, Issue 2, 1979, Pages 361-381
Relations Among Complexity Measures
Author keywords

automata; clrcuit; complexity; cost; network; simulation; size; time; Turing machine
Indexed keywords

AUTOMATA THEORY;
EID: 0018456413     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322123.322138     Document Type: Article
Times cited : (244)
References (11)
  • 1
    • 33750021482 scopus 로고
    • On the minimum computation time of functions
    • (Aug)
    • Cook, S A, AND Aanderaa, S O On the minimum computation time of functions Trans AMS 142 (Aug 1969), 291-314.
    • (1969) Trans AMS , vol.142 , pp. 291-314
    • Cook, S.A.1    Aanderaa, S.O.2
  • 2
    • 0015416906 scopus 로고
    • Real-time simulation of multihead tape units
    • (Oct)
    • Fischer, P C, Meyer, A R, AND Rosenberg, A L Real-time simulation of multihead tape units J A CM 19, 4 (Oct 1972), 590-607.
    • (1972) J A CM 19 , vol.4 , pp. 590-607
    • Fischer, P.C.1    Meyer, A.R.2    Rosenberg, A.L.3
  • 3
    • 0040722831 scopus 로고
    • On-line Turing machine computations
    • (Feb)
    • Hennie, F C On-line Turing machine computations IEEE Trans EC 15, 1 (Feb 1966), 34-44.
    • (1966) IEEE Trans EC 15 , vol.1 , pp. 34-44
    • Hennie, F.C.1
  • 4
    • 0006672480 scopus 로고    scopus 로고
    • Two-tape simulation of multitape Turing machines
    • (Oct)
    • Hennie, F C, AND Stearns, R E Two-tape simulation of multitape Turing machines J ACM 13, 4 (Oct 1966), 533-546.
    • J ACM 13 , vol.4 , pp. 533-546
    • Hennie, F.C.1    Stearns, R.E.2
  • 5
    • 84963664699 scopus 로고
    • New real-time simulations of multihead tape units
    • Boulder, Colo, May
    • Leong, B, AND Seiferas, J New real-time simulations of multihead tape units Proc 9th Annual ACM Symp Theory of Comptng, Boulder, Colo, May 1977, pp 239-248.
    • (1977) Proc 9th Annual ACM Symp Theory of Comptng , pp. 239-248
    • Leong, B.1    Seiferas, J.2
  • 6
    • 0012529110 scopus 로고    scopus 로고
    • Complexity in electronic switching circuits
    • (March)
    • Muller, D E Complexity in electronic switching circuits IRE Trans EC 5, 1 (March 1956), 15-19.
    • IRE Trans EC 5 , vol.1 , pp. 15-19
    • Muller, D.E.1
  • 7
    • 0010015169 scopus 로고
    • An improved overlap argument for on-line multiplication
    • Paterson, M S, Fischer, M J, AND Meyer, A R An improved overlap argument for on-line multiplication SIAM-AMS Proc 7 (1974), 97-111.
    • (1974) SIAM-AMS Proc , vol.7 , pp. 97-111
    • Paterson, M.S.1    Fischer, M.J.2    Meyer, A.R.3
  • 8
    • 0015415664 scopus 로고    scopus 로고
    • Computational work and time on finite machines
    • (Oct)
    • Savage, J E Computational work and time on finite machines J ACM 19, 4 (Oct 1972), 660-674.
    • J ACM 19 , vol.4 , pp. 660-674
    • Savage, J.E.1
  • 9
    • 0003047832 scopus 로고
    • The network complexity and the Turing machine complexity of finite functions
    • Schnorr, C P The network complexity and the Turing machine complexity of finite functions Acta informatica 7 (1976), 95-107.
    • (1976) Acta informatica , vol.7 , pp. 95-107
    • Schnorr, C.P.1
  • 10
    • 0039537322 scopus 로고
    • Zwei-band Simulation von Turingmaschinen
    • Stoss, H -J Zwei-band Simulation von Turingmaschinen Computing 7 (1971), 222-235.
    • (1971) Computing , vol.7 , pp. 222-235
    • Stoss, H.-J.1
  • 11
    • 84960561455 scopus 로고
    • On computable numbers, with an application to the
    • (corrections 43 (1937), 544-546.)
    • Turing, A M On computable numbers, with an application to the Entscheidungsproblem Proc London Math Soc (2) 42 (1936), 230-265, corrections 43 (1937), 544-546.
    • (1936) Entscheidungsproblem Proc London Math Soc (2) , vol.42 , pp. 230-265
    • Turing, A.M.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.