{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:31:29Z","timestamp":1725532289317},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020162"},{"type":"electronic","value":"9783642020179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02017-9_12","type":"book-chapter","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T15:38:06Z","timestamp":1242056286000},"page":"88-97","source":"Crossref","is-referenced-by-count":0,"title":["Quantitative Aspects of Speed-Up and Gap Phenomena"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Kr\u00e4ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"1","volume-title":"Computability, enumerability, unsolvability. Directions in recursion theory","author":"K. Ambos-Spies","year":"1996","unstructured":"Ambos-Spies, K.: Resource-bounded genericity. In: Cooper, S., Slaman, T., Wainer, S. (eds.) Computability, enumerability, unsolvability. Directions in recursion theory, pp. 1\u201360. Cambridge University Press, Cambridge (1996)"},{"key":"12_CR2","first-page":"1","volume-title":"Complexity, Logic and Recursion Theory","author":"K. Ambos-Spies","year":"1997","unstructured":"Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory, pp. 1\u201347. Dekker, New York (1997)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ambos-Spies, K., Reimann, J.: Effective Baire category concepts. In: Proc. Sixth Asian Logic Conference 1996, pp. 13\u201329. Singapore University Press (1997)","DOI":"10.1142\/9789812812940_0002"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM\u00a014(2), 322\u2013336 (1967)","journal-title":"Journal of the ACM"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321679.321691","volume":"19","author":"A. Borodin","year":"1972","unstructured":"Borodin, A.: Computational complexity and the existence of complexity gaps. Journal of the ACM\u00a019(1), 158\u2013174 (1972)","journal-title":"Journal of the ACM"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(95)00066-6","volume":"154","author":"C. Calude","year":"1996","unstructured":"Calude, C., Zimand, M.: Effective category and measure in abstract complexity theory. Theoretical Computer Science\u00a0154(2), 307\u2013327 (1996)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J. Lutz","year":"1992","unstructured":"Lutz, J.: Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences\u00a044, 220\u2013258 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","volume":"136","author":"E. Mayordomo","year":"1994","unstructured":"Mayordomo, E.: Almost every set in exponential time is P-bi-immune. Theoretical Computer Science\u00a0136, 487\u2013506 (1994)","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: On the size of sets of computable functions. In: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, pp. 190\u2013196 (1973)","DOI":"10.1109\/SWAT.1973.23"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2272545","volume":"37","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Fischer, P.C.: Computational speed-up by effective operators. Journal of Symbolic Logic\u00a037(1), 55\u201368 (1972)","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C. Schnorr","year":"1973","unstructured":"Schnorr, C.: Process complexity and effective random tests. Journal of Computer and System Sciences\u00a07, 376\u2013388 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR12","unstructured":"Trakhtenbrot, B.A.: Complexity of algorithms and computations. Course Notes, Novosibirsk (in Russian) (1967)"},{"key":"12_CR13","volume-title":"Computational Complexity: A Quantitative Perspective","author":"M. Zimand","year":"2006","unstructured":"Zimand, M.: Computational Complexity: A Quantitative Perspective. Elsevier, Amsterdam (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02017-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T10:17:21Z","timestamp":1619777841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02017-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020162","9783642020179"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02017-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}