article

Free access

An Overview of the Theory of Computational Complexity

Authors:

J. Hartmanis and

J. E. HopcroftAuthors Info & Claims

Journal of the ACM (JACM), Volume 18, Issue 3

Pages 444 - 475

https://doi.org/10.1145/321650.321661

Published: 01 July 1971 Publication History

PDF eReader

References

[1]

AXT, P. Enumeration and the Grzegorczyk hierarchy. Z. Math. Logik Grundlagen Math. 9 (1963), 53-65.

Google Scholar

[2]

BECVAR, J. Real-time and complexity problems in automata theory. Kybernetika 1 (1965), 475--497.

Google Scholar

[3]

BLUM, N. On effective procedures for speeding up algorithms. Conf. Rec. ACM Symp. on Theory of Computing, 1969, pp. 43-53.

Crossref

Google Scholar

[4]

BORODIN, A., CONSTABLE, R. L., AND HOPCROFT, J .E . Dense and nondense families of complexity classes. IEEE Conf. Rec. Tenth Ann. Symp. on Switching and Automata Theory, 1969, pp. 7-19.

Google Scholar

[5]

COBHAM, A. On the Hartmanis-Stearns problem for a class of tag machines. IEEE Conf. Rec. Ninth Ann. Symp. on Switching and Automata Theory, 1968, pp. 51-60.

Google Scholar

[6]

CONSTABLE, R.L. The operator gap. IEEE Conf. Rec. Tenth Ann. Symp. on Switching and Automata Theory, 1969, pp. 20-26.

Google Scholar

[7]

FISCHER, P. C. Multi-tape and infinite-state automata--a survey. Comm. ACM 8 (1965), 799--805.

Crossref

Google Scholar

[8]

FISCHER, P. C. The reduction of tape reversals for off-line one-tape Turing machines," J. Computer Systems Sciences 2 (1968), 136-147.

Google Scholar

[9]

FISCHER, P. C., HARTMANIS J. AND BLUM M. Tape reversal complexity hierarchies. IEEE Conf. Rec. Ninth Ann. Syrup. on Switching and Automata Theory, 1968, pp. 373-382.

Google Scholar

[10]

GRZEGORCZYK, A. Some classes of recursive functions. Rozprawy Mat. $, Warsaw, (1953), 1-45.

Google Scholar

[11]

HARTMANIS, J. Tape reversal bounded Turing machine computations. J. Computer Systems Sciences 2 (1968), 117-135.

Google Scholar

[12]

HENNIE, F. C. One-tape, off-line Turing machine computations. Inf. Conlr. 8 (1965), 553- 578.

Google Scholar

[13]

HENNIE, F. C. Crossing sequences and off-line Turing machine computations. 1965 IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, pp. 168-172.

Google Scholar

[14]

HOPCROFT, J. E., AND ULLMAN, J.D. Relations between time and tape complexities. J. ACM 15 (1958), 414-427.

Crossref

Google Scholar

[15]

HOPCROFT, J. E., AND ULLMAN, J. D. Some results on tape bounded Turing machines," J. ACM 16 (1969), 168--177.

Crossref

Google Scholar

[16]

IRLAND, M. I., AND FISCHER, P.C. A bibliography on computational complexity. Res. Rep. CSRR 2028, U. of Waterloo, Ontario, Canada, Oct. 1970.

Google Scholar

[17]

KARP, R.M. Some bounds on the storage requirements of sequential machines and Turing machines. J. ACM 1~ (1967), 478--489.

Crossref

Google Scholar

[18]

LEwis, P. M. II, STEARNS, R. E., AND HARTMANIS, J. Memory bounds for recognition of context-free and context-sensitive languages. 1965 IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, pp. 191-202.

Google Scholar

[19]

MCCREIGHT, E. M. Classes of computable functions defined by bounds on computation. Doctoral Th., Computer Sci. Dep., Carnegie-Mellon U., Pittsburgh, Pa., 1969.

Crossref

Google Scholar

[20]

MEYER, A. R., AND RITCHIE, D.M. The complexity of loop programs. Proc. ACM 22nd Nat. Conf., 1967, Psychonetics, Narberth, Pa., pp. 465-469.

Crossref

Google Scholar

[21]

RABIN, M.O. Real time computation. Israel J. Math. I (1964), 203-211.

Google Scholar

[22]

RITCHIE, R.W. Classes of predictably computable functions. Trans. Amer. Math. Soc. 106 (1963), 139-173.

Google Scholar

[23]

SAVlTCH, W. J. Deterministic simulation of non-deterministic Turing machines (detailed abstract). Conf. Rec. ACM Symp. on Theory of Computing, 1969, pp. 247-248.

Crossref

Google Scholar

[24]

TRAKHTENBROT, B.A. Turing computations with logorithmie delay. Algebra i Logika 3, ~, in Russian, (1964), 33-48.

Google Scholar

[25]

YAMADA, H. Real-time computation and recursive functions not real-time computable," IRE Trans. Elec. Comp. EC-11 (1962), 753-760.

Google Scholar

Cited By

View all

Li W(2024)Optimizing with Attractor: A TutorialACM Computing Surveys10.1145/364835456:9(1-41)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3648354
Süzer AOktal H(2023)A comparison analysis on forward error correction technology: a future perspective for GNSSAircraft Engineering and Aerospace Technology10.1108/AEAT-10-2021-031995:8(1311-1320)Online publication date: 28-Jun-2023
https://doi.org/10.1108/AEAT-10-2021-0319
Li WLi W(2023)Traveling Salesman ProblemThe Traveling Salesman Problem10.1007/978-3-031-35719-0_2(9-25)Online publication date: 9-Jul-2023
https://doi.org/10.1007/978-3-031-35719-0_2
Show More Cited By

Index Terms

An Overview of the Theory of Computational Complexity
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Models of computation
    1. Computability
      1. Turing machines

Recommendations

An overview of computational complexity
ACM Turing award lectures

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...
Read More
An overview of computational complexity

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...
Read More
Kolmogorov techniques in computational complexity theory
Read More

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 18, Issue 3

July 1971

147 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321650

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1971

Published in JACM Volume 18, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

124
Total Citations
View Citations
2,866
Total Downloads

Downloads (Last 12 months)426
Downloads (Last 6 weeks)43

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li W(2024)Optimizing with Attractor: A TutorialACM Computing Surveys10.1145/364835456:9(1-41)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3648354
Süzer AOktal H(2023)A comparison analysis on forward error correction technology: a future perspective for GNSSAircraft Engineering and Aerospace Technology10.1108/AEAT-10-2021-031995:8(1311-1320)Online publication date: 28-Jun-2023
https://doi.org/10.1108/AEAT-10-2021-0319
Li WLi W(2023)Traveling Salesman ProblemThe Traveling Salesman Problem10.1007/978-3-031-35719-0_2(9-25)Online publication date: 9-Jul-2023
https://doi.org/10.1007/978-3-031-35719-0_2
Luhmann NLuhmann N(2022)KomplexitätSchriften zur Organisation 510.1007/978-3-658-23434-8_47(337-344)Online publication date: 23-Feb-2022
https://doi.org/10.1007/978-3-658-23434-8_47
Cutland N(2018)Computability10.1017/CBO9781139171496Online publication date: 28-May-2018
https://doi.org/10.1017/CBO9781139171496
Nurmi H(2016)On the concept of complexity and its relationship to the methodology of policy-oriented researchSocial Science Information10.1177/05390184740130010413:1(55-80)Online publication date: 3-Sep-2016
https://doi.org/10.1177/053901847401300104
van Leeuwen JWiedermann J(2015)Separating the Classes of Recursively Enumerable Languages Based on Machine SizeInternational Journal of Foundations of Computer Science10.1142/S012905411550038026:06(677-695)Online publication date: Sep-2015
https://doi.org/10.1142/S0129054115500380
Bennison V(2014)Recursively enumerable complexity sequences and measure independenceThe Journal of Symbolic Logic10.2307/227341245:03(417-438)Online publication date: 12-Mar-2014
https://doi.org/10.2307/2273412
Monk JMycielski JSchmidt J(2014)Meeting of the Association for Symbolic Logic, Dallas 1973The Journal of Symbolic Logic10.2307/227308938:03(541-549)Online publication date: 12-Mar-2014
https://doi.org/10.2307/2273089
Alton D(2014)Diversity of speed-ups and embeddability in computational complexityThe Journal of Symbolic Logic10.2307/227295941:1(199-214)Online publication date: 12-Mar-2014
https://doi.org/10.2307/2272959
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

An overview of computational complexity

An overview of computational complexity

Kolmogorov techniques in computational complexity theory

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations