On computational complexity and the nature of computer science-Reference-Cited by-同舟云学术

On computational complexity and the nature of computer science

Published:1995-03 Issue:1 Volume:27 Page:7-16
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Hartmanis Juris¹

Affiliation:

1. Cornell Univ., Ithaca, NY

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. A Machine-Independent Theory of the Complexity of Recursive Functions

2. BROOKS F. P. JR. 1975. The Mythical Man-Month: Essays on Software Engineering. Addison- Wesley Reading Mass. BROOKS F. P. JR. 1975. The Mythical Man-Month: Essays on Software Engineering. Addison- Wesley Reading Mass.

3. HARTMANIS J. AND LIN H. EDS. 1992. Computing the Future: A Broader Agenda for Computing Science and Engineering. National Academy Press Washington D.C. HARTMANIS J. AND LIN H. EDS. 1992. Computing the Future: A Broader Agenda for Computing Science and Engineering. National Academy Press Washington D.C.

4. Lecture Notes in Computer Science;HARTMANIS J.

5. On the computational complexity of algorithms;HARTMAN~S J.;Trans. Am. Math. Soc.,1965

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reconstructing the Digital – An Architectural Perspective for Non-Engineers (Discussion Paper);Proceedings of the 23rd Koli Calling International Conference on Computing Education Research;2023-11-13

2. ARIadne – An Explanation Model for Digital Artefacts;Informatics in Education;2023-09-04

3. Between Fiction, Reality, and Ideality: Virtual Objects as Computationally Grounded Intentional Objects;Philosophy & Technology;2023-05-01

4. Space Complexity of Stack Automata Models;International Journal of Foundations of Computer Science;2021-09

5. Space Complexity of Stack Automata Models;Developments in Language Theory;2020