A difference in complexity between recursion and tail recursion
From MaRDI portal
Publication:519902
DOI10.1007/s00224-016-9673-5zbMath1380.03038OpenAlexW2310420552MaRDI QIDQ519902
Publication date: 31 March 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-016-9673-5
Complexity of computation (including implicit computational complexity) (03D15) Abstract and axiomatic computability and recursion theory (03D75)
Cites Work
- Unnamed Item
- Unnamed Item
- A simplified proof of \(DDL<DL\)
- Theory of program structures: Schemes, semantics, verification
- An infinite pebble game and applications
- Finite alogorithmic procedures and computation theories.
- A difference in expressive power between flowcharts and recursion schemes
- Algorithmic Procedures
- Arithmetic complexity
- New Computational Paradigms
This page was built for publication: A difference in complexity between recursion and tail recursion
