Skip to main content
Conference Proceedings

Relations between semantics and complexity of recursive programs-

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1974) 14 LNCS 129-140
DOI: 10.1007/3-540-06841-4_56
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Ausiello, G. (1974). Relations between semantics and complexity of recursive programs-. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14 LNCS, pp. 129–140). Springer Verlag. https://doi.org/10.1007/3-540-06841-4_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free