J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 , pp. 285–306 [Book Review]

Journal of Symbolic Logic 32 (1):120-121 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271275

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,928

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: J. Hartmanis, R. E. Stearns, On the Computational Complexity of Algorithms. [REVIEW]Jiri Becvar - 1967 - Journal of Symbolic Logic 32 (1):120-121.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
Review: J. Hartmanis, R. E. Stearns, Computational Complexity of Recursive Sequences. [REVIEW]Jiri Becvar - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Computational Complexity of Recursive Sequences.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):121-122.
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90. [REVIEW]Jiří Bečvář - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp. [REVIEW]Uwe Schöning - 1991 - Journal of Symbolic Logic 56 (1):335-336.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Alan Rose and J. Barkley Rosser. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society, vol. 87 , pp. 1–53. - C. A. Meredith. The dependence of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , p. 54. - C. C. Chang. Proof of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , pp. 55–56. [REVIEW]Atwell R. Turquette - 1959 - Journal of Symbolic Logic 24 (3):248-249.
Numerical Methods, Complexity, and Epistemic Hierarchies.Nicolas Fillion & Sorin Bangu - 2015 - Philosophy of Science 82 (5):941-955.
Review: Juris Hartmanis, Computational Complexity Theory. [REVIEW]Uwe Schoning - 1991 - Journal of Symbolic Logic 56 (1):335-336.
Hartmanis J.. Context-free languages and Turing machine computations. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence 1967, pp. 42–51. [REVIEW]S. Ginsburg - 1972 - Journal of Symbolic Logic 37 (4):759-759.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
Regularity Preserving Modifications of Regular Expressions.R. E. Stearns & J. Hartmanis - 1966 - Journal of Symbolic Logic 31 (2):265-265.
Peter J. Nyikos. A provisional solution to the normal Moore space problem_. Proceedings of the American Mathematical Society, vol. 78 (1980), pp. 429–435. - William G. Fleissner. _If all normal Moore spaces are metrizable, then there is an inner model with a measurable cardinal_. Transactions of the American Mathematical Society, vol. 273 (1982), pp. 365–373. - Alan Dow, Franklin D. Tall, and William A. R. Weiss. _New proofs of the consistency of the normal Moore space conjecture I_. Topology and its applications, vol. 37 (1990), pp. 33–51. - Zoltán Balogh. _On collectionwise normality of locally compact, normal spaces. Transactions of the American Mathematical Society, vol. 323 (1991), pp. 389–411. [REVIEW]Gary Gruenhage - 2002 - Bulletin of Symbolic Logic 8 (3):443-445.
Seymour Ginsburg. Some remarks on abstract machines. Transactions of the American Mathematical Society, vol. 96 , pp. 400–444. - Seymour Ginsburg and Gene F. Rose. A comparison of the work done by generalized sequential machines and Turing machines. Transactions of the American Mathematical Society, vol. 103 , pp. 394–402. [REVIEW]Lars Löfgren - 1972 - Journal of Symbolic Logic 37 (2):411.

Analytics

Added to PP
2016-06-30

Downloads
14 (#990,773)

6 months
1 (#1,471,551)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references