Algorithmic complexity of recursive and inductive algorithms. Burgin, M. Theoretical Computer Science, 317(1-3):31–60, 2004.
Paper bibtex @ARTICLE{Bur04,
author = {Burgin, Mark},
title = {Algorithmic complexity of recursive and inductive algorithms},
journal = {Theoretical Computer Science},
year = {2004},
volume = {317},
pages = {31--60},
number = {1-3},
file = {Bur04.pdf:Bur04.pdf:PDF},
issn = {0304-3975},
mrclass = {68Q30 (03D10 68Q05)},
mrnumber = {2074734},
mrreviewer = {Marius Zimand},
url = {https://doi.org/10.1016/j.tcs.2003.12.003}
}
Downloads: 0
{"_id":"Rs9PHqoE4iqyjJFpj","bibbaseid":"burgin-algorithmiccomplexityofrecursiveandinductivealgorithms-2004","authorIDs":[],"author_short":["Burgin, M."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Burgin"],"firstnames":["Mark"],"suffixes":[]}],"title":"Algorithmic complexity of recursive and inductive algorithms","journal":"Theoretical Computer Science","year":"2004","volume":"317","pages":"31–60","number":"1-3","file":"Bur04.pdf:Bur04.pdf:PDF","issn":"0304-3975","mrclass":"68Q30 (03D10 68Q05)","mrnumber":"2074734","mrreviewer":"Marius Zimand","url":"https://doi.org/10.1016/j.tcs.2003.12.003","bibtex":"@ARTICLE{Bur04,\r\n author = {Burgin, Mark},\r\n title = {Algorithmic complexity of recursive and inductive algorithms},\r\n journal = {Theoretical Computer Science},\r\n year = {2004},\r\n volume = {317},\r\n pages = {31--60},\r\n number = {1-3},\r\n file = {Bur04.pdf:Bur04.pdf:PDF},\r\n issn = {0304-3975},\r\n mrclass = {68Q30 (03D10 68Q05)},\r\n mrnumber = {2074734},\r\n mrreviewer = {Marius Zimand},\r\n url = {https://doi.org/10.1016/j.tcs.2003.12.003}\r\n}\r\n\r\n","author_short":["Burgin, M."],"key":"Bur04","id":"Bur04","bibbaseid":"burgin-algorithmiccomplexityofrecursiveandinductivealgorithms-2004","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.tcs.2003.12.003"},"downloads":0},"bibtype":"article","biburl":"http://cca-net.de/publications/lit.bib","creationDate":"2019-09-11T13:29:34.933Z","downloads":0,"keywords":[],"search_terms":["algorithmic","complexity","recursive","inductive","algorithms","burgin"],"title":"Algorithmic complexity of recursive and inductive algorithms","year":2004,"dataSources":["t7rKiAbxugj4Agz8M"]}