On the Space and Time Complexity of Functions Computable by Simple Programs
From MaRDI portal
Publication:3036704
DOI10.1137/0212048zbMath0524.68030OpenAlexW2063028853MaRDI QIDQ3036704
Tat-Hung Chan, Oscar H. Ibarra
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212048
Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (1)
This page was built for publication: On the Space and Time Complexity of Functions Computable by Simple Programs