{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:20Z","timestamp":1725663260697},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_31","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:01:41Z","timestamp":1330203701000},"page":"318-326","source":"Crossref","is-referenced-by-count":2,"title":["Extensional properties of sets of time bounded complexity (extended abstract)"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Maass","sequence":"first","affiliation":[]},{"given":"Theodore A.","family":"Slaman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"31_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (Reading, 1974)."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM, 14(1967), 322\u2013336.","journal-title":"J. ACM"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S. A. Cook","year":"1973","unstructured":"S.A. Cook, R.A. Reckhow, Time-bounded random access machines, J. Comp. Syst. Sc., 7(1973), 354\u2013375.","journal-title":"J. Comp. Syst. Sc."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/321650.321661","volume":"18","author":"J. Hartmanis","year":"1971","unstructured":"J. Hartmanis, J.E. Hopcroft, An overview of the theory of computational complexity, J. ACM, 18(1971), 444\u2013475.","journal-title":"J. ACM"},{"key":"31_CR5","first-page":"1464","volume":"14","author":"L. A. Levin","year":"1973","unstructured":"L.A. Levin, On storage capacity for algorithms, Soviet Math. Dokl., 14(1973), 1464\u20131466.","journal-title":"Soviet Math. Dokl."},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.2307\/2271779","volume":"40","author":"N. Lynch","year":"1975","unstructured":"N. Lynch, Helping: several formalizations, J. of Symbolic Logic, 40(1975), 555\u2013566.","journal-title":"J. of Symbolic Logic"},{"key":"31_CR7","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland (Amsterdam, 1978)."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","volume":"25","author":"S. Mahaney","year":"1982","unstructured":"S. Mahaney, Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis, J. Comp. Syst. Sc., 25(1982), 130\u2013143.","journal-title":"J. Comp. Syst. Sc."},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272545","volume":"37","author":"A. R. Meyer","year":"1972","unstructured":"A.R. Meyer, P.C. Fischer, Computational speed-up by effective operators, J. of Symbolic Logic, 37(1972), 55\u201368.","journal-title":"J. of Symbolic Logic"},{"key":"31_CR10","first-page":"97","volume":"108","author":"A. R. Meyer","year":"1979","unstructured":"A.R. Meyer, K. Winklmann, The fundamental theorem of complexity theory, Math. Centre Tracts, 108(1979), 97\u2013112.","journal-title":"Math. Centre Tracts"},{"key":"31_CR11","unstructured":"W. Maass, T.A. Slaman, On the complexity types of computable sets (extended abstract), to appear in: Proc. of the Structure in Complexity Theory Conference 1989."},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/malq.19750210106","volume":"21","author":"C. P. Schnorr","year":"1975","unstructured":"C.P. Schnorr, G. Stumpf, A characterization of complexity sequences, Zeitschr. f. math. Logik u. Grundlagen d. Math., 21(1975), 47\u201356.","journal-title":"Zeitschr. f. math. Logik u. Grundlagen d. Math."},{"key":"31_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R. I. Soare","year":"1987","unstructured":"R.I. Soare Recursively Enumerable Sets and Degrees, Springer (Berlin, 1987)."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:37Z","timestamp":1619571817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}