{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:04Z","timestamp":1725662884245},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_193","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:54:05Z","timestamp":1330185245000},"page":"179-185","source":"Crossref","is-referenced-by-count":0,"title":["Non-linear speed-up theorem for two register minsky machines"],"prefix":"10.1007","author":[{"given":"M.","family":"Bene\u0161ov\u00e1","sequence":"first","affiliation":[]},{"given":"I.","family":"Korec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"16_CR1","first-page":"53","volume":"XXIII","author":"I. Korec","year":"1969","unstructured":"Korec, I., A complexity valuation of the partial recursive functions following the expectation of length of their computations on Minsky machines. AFRNUC MATHEMATICA, XXIII (1969), 53\u2013112.","journal-title":"AFRNUC MATHEMATICA"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02238815","volume":"6","author":"H. J. Stoss","year":"1970","unstructured":"Stoss, H.J., k-Band-Simulation von k-Kopf-Turing-Maschinen, Computing, 6 (1970), 309\u2013317.","journal-title":"Computing"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Stearns, R.E., On the computational complexity of algorithms, Trans. Amer. Soc., May (1965), 285\u2013306.","DOI":"10.2307\/1994208"},{"key":"16_CR4","unstructured":"Mal\u0107ev, A.I., Algorithms and recursive functions (in Russian), Moscow, 1965."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_193.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:22Z","timestamp":1605643042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_193","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}