On the Space and Time Complexity of Functions Computable by Simple Programs

DOI10.1137/0212048MaRDI QIDQ3036704zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

loop-free programsspace complexitytime complexity

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Une méthodologie du calcul hardware des fonctions élémentaires

This page was built for publication: On the Space and Time Complexity of Functions Computable by Simple Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036704)