A note on the complexity of program evaluation
- 1 December 1984
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 17 (1) , 85-96
- https://doi.org/10.1007/bf01744435
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Simple programming languages and restricted classes of turing machinesTheoretical Computer Science, 1983
- On the Complexity of Flowchart and Loop Program Schemes and Programming LanguagesJournal of the ACM, 1982
- The Complexity of the Equivalence Problem for Simple ProgramsJournal of the ACM, 1981
- Characterizations of Presburger FunctionsSIAM Journal on Computing, 1981
- On the Computational Complexity of Program Scheme EquivalenceSIAM Journal on Computing, 1980
- Analysis of simple programs over different sets of primitivesPublished by Association for Computing Machinery (ACM) ,1980
- Simple Programs Realize Exactly Presburger FormulasSIAM Journal on Computing, 1976
- Subrecursive Programming Languages, Part IJournal of the ACM, 1972
- The complexity of loop programsPublished by Association for Computing Machinery (ACM) ,1967
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965