The Complexity of Finite Memory Programs with Recursion
- 1 April 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (2) , 312-321
- https://doi.org/10.1145/322063.322074
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Even Simple Programs Are Hard To AnalyzeJournal of the ACM, 1977
- A Formalization of Transition Diagram SystemsJournal of the ACM, 1973
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Revised report on the algorithmic language ALGOL 60Communications of the ACM, 1963