Algorithmic complexity of recursive and inductive algorithms

From MaRDI portal
Publication:1434367

DOI10.1016/j.tcs.2003.12.003zbMath1072.68048OpenAlexW2007412164MaRDI QIDQ1434367

Mark S. Burgin

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.003



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (5)



Cites Work


This page was built for publication: Algorithmic complexity of recursive and inductive algorithms