The Complexity of Finite Memory Programs with Recursion
From MaRDI portal
Publication:4147590
DOI10.1145/322063.322074zbMath0371.68017MaRDI QIDQ4147590
Neil D. Jones, Steven S. Muchnick
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322063.322074
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68N01: General topics in the theory of software
Related Items
Complexity of proving program correctness, An observationally complete program logic for imperative higher-order functions, Some simplified undecidable and NP-hard problems for simple programs, An approach to deciding the observational equivalence of Algol-like languages