On the computational complexity of algorithms. Hartmanis, J., Stearns, R. E., & Maass, W. Transactions of the American Mathematical Society, 117(8556):285–306, 2000. ![On the computational complexity of algorithms [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex @article{hartmanis_computational_2000,
title = {On the computational complexity of algorithms},
volume = {117},
issn = {0002-9947},
url = {http://www.ams.org/tran/1965-117-00/S0002-9947-1965-0170805-7/},
doi = {10/ckv299},
number = {8556},
urldate = {2015-05-10},
journal = {Transactions of the American Mathematical Society},
author = {Hartmanis, J. and Stearns, R. E. and Maass, Wolfgang},
year = {2000},
pages = {285--306}
}
Downloads: 0
{"_id":"YNGJH4aGDrofxPAT2","bibbaseid":"hartmanis-stearns-maass-onthecomputationalcomplexityofalgorithms-2000","authorIDs":[],"author_short":["Hartmanis, J.","Stearns, R. E.","Maass, W."],"bibdata":{"bibtype":"article","type":"article","title":"On the computational complexity of algorithms","volume":"117","issn":"0002-9947","url":"http://www.ams.org/tran/1965-117-00/S0002-9947-1965-0170805-7/","doi":"10/ckv299","number":"8556","urldate":"2015-05-10","journal":"Transactions of the American Mathematical Society","author":[{"propositions":[],"lastnames":["Hartmanis"],"firstnames":["J."],"suffixes":[]},{"propositions":[],"lastnames":["Stearns"],"firstnames":["R.","E."],"suffixes":[]},{"propositions":[],"lastnames":["Maass"],"firstnames":["Wolfgang"],"suffixes":[]}],"year":"2000","pages":"285–306","bibtex":"@article{hartmanis_computational_2000,\n\ttitle = {On the computational complexity of algorithms},\n\tvolume = {117},\n\tissn = {0002-9947},\n\turl = {http://www.ams.org/tran/1965-117-00/S0002-9947-1965-0170805-7/},\n\tdoi = {10/ckv299},\n\tnumber = {8556},\n\turldate = {2015-05-10},\n\tjournal = {Transactions of the American Mathematical Society},\n\tauthor = {Hartmanis, J. and Stearns, R. E. and Maass, Wolfgang},\n\tyear = {2000},\n\tpages = {285--306}\n}\n\n","author_short":["Hartmanis, J.","Stearns, R. E.","Maass, W."],"key":"hartmanis_computational_2000","id":"hartmanis_computational_2000","bibbaseid":"hartmanis-stearns-maass-onthecomputationalcomplexityofalgorithms-2000","role":"author","urls":{"Paper":"http://www.ams.org/tran/1965-117-00/S0002-9947-1965-0170805-7/"},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/zotero/k4rtik","creationDate":"2020-05-31T17:07:22.760Z","downloads":0,"keywords":[],"search_terms":["computational","complexity","algorithms","hartmanis","stearns","maass"],"title":"On the computational complexity of algorithms","year":2000,"dataSources":["Z5Dp3qAJiMzxtvKMq"]}