{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:54:52Z","timestamp":1725605692890},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642218743"},{"type":"electronic","value":"9783642218750"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21875-0_11","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:51:59Z","timestamp":1315468319000},"page":"102-111","source":"Crossref","is-referenced-by-count":0,"title":["Axiomatizing Resource Bounds for Measure"],"prefix":"10.1007","author":[{"given":"Xiaoyang","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyadev","family":"Nandakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James S.","family":"Royer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Allender, E., Strauss, M.: Measure on small complexity classes with applications for BPP. In: Proceedings of the 35th FOCS, pp. 807\u2013818 (1994)","DOI":"10.1109\/SFCS.1994.365713"},{"key":"11_CR2","series-title":"Lecture Notes in Pure and Applied Mathematics","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. Lecture Notes in Pure and Applied Mathematics, pp. 1\u201347. Marcel Dekker, New York (1997)"},{"key":"11_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J.L. Balc\u00e1zar","year":"1995","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity I, 2nd edn. Springer, Berlin (1995)","edition":"2"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Torenvliet, L.: On the structure of complete sets. In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, pp. 118\u2013133 (1994)","DOI":"10.1109\/SCT.1994.315811"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Torenvliet, L.: Complete sets and structure in subrecursive classes. In: Proceedings of Logic Colloquium 1996. LNL, vol.\u00a012, pp. 45\u201378 (1998)","DOI":"10.1007\/978-3-662-22110-5_2"},{"key":"11_CR6","volume-title":"Logic, Methodology and Philosophy of Science II.","author":"A. Cobham","year":"1965","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Logic, Methodology and Philosophy of Science II. North Holland, Amsterdam (1965)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s00224-007-9075-9","volume":"45","author":"J.J. Dai","year":"2009","unstructured":"Dai, J.J.: An outer-measure approach for resource-bounded measure. Theory of Computing Systems\u00a045(1), 64\u201373 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"1:9","key":"11_CR8","first-page":"1","volume":"3","author":"N. Danner","year":"2007","unstructured":"Danner, N., Royer, J.: Adventures in time and space. Logical Methods in Computer Science\u00a03(1:9), 1\u201353 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-73545-8_15","volume-title":"Computing and Combinatorics","author":"R.C. Harkins","year":"2007","unstructured":"Harkins, R.C., Hitchcock, J.M.: Dimension, halfspaces, and the density of hard sets. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 129\u2013139. Springer, Heidelberg (2007)"},{"key":"11_CR10","unstructured":"Hitchcock, J.M.: Resource-Bounded Measure Bibliography(current January, 2011), \n                  \n                    http:\/\/www.cs.uwyo.edu\/~jhitchco\/bib\/rbm.html"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.jcss.2005.06.008","volume":"72","author":"R. Impagliazzo","year":"2006","unstructured":"Impagliazzo, R., Kapron, B.: Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci.\u00a072(2), 286\u2013320 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1017\/S0956796800003841","volume":"11","author":"R. Irwin","year":"2001","unstructured":"Irwin, R., Kapron, B., Royer, J.: On characterizations of basic feasible functionals, part i. Journal of Functional Programming\u00a011(1), 117\u2013153 (2001)","journal-title":"Journal of Functional Programming"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"B. Kapron","year":"1996","unstructured":"Kapron, B., Cook, S.: A new characterization of type 2 feasibility. SIAM Journal on Computing\u00a025, 117\u2013132 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J.H. Lutz","year":"1992","unstructured":"Lutz, J.H.: Almost everywhere high nonuniform complexity. J.\u00a0Comput. Syst. Sci.\u00a044(2), 220\u2013258 (1992)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Lutz, J.H.: Resource-bounded measure. In: Proceedings of the 13th IEEE Conference on Computational Complexity, pp. 236\u2013248 (1998)","DOI":"10.1109\/CCC.1998.694611"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539792237498","volume":"23","author":"J.H. Lutz","year":"1994","unstructured":"Lutz, J.H., Mayordomo, E.: Measure, stochasticity, and the density of hard languages. SIAM Journal on Computing\u00a023(4), 762\u2013779 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR17","first-page":"64","volume":"68","author":"J.H. Lutz","year":"1999","unstructured":"Lutz, J.H., Mayordomo, E.: Twelve problems in resource-bounded measure. Bulletin of EATCS\u00a068, 64\u201380 (1999)","journal-title":"Bulletin of EATCS"},{"key":"11_CR18","unstructured":"Mayordomo, E.: Measuring in PSPACE. In: Proceedings of the 7th International Meeting of Young Computer Scientists. Topics in Computer Science, vol.\u00a06, pp. 93\u2013100. Gordon and Breach (1994)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(76)80035-9","volume":"12","author":"K. Mehlhorn","year":"1976","unstructured":"Mehlhorn, K.: Polynomial and abstract subrecursive classes. Journal of Computer and System Science\u00a012, 147\u2013178 (1976)","journal-title":"Journal of Computer and System Science"},{"issue":"1\u20133","key":"11_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2008.02.013","volume":"400","author":"P. Moser","year":"2008","unstructured":"Moser, P.: Martingale families and dimension in P. Theoretical Computer Science\u00a0400(1\u20133), 46\u201361 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"11_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2007.11.019","volume":"106","author":"P. Moser","year":"2008","unstructured":"Moser, P.: Resource-bounded measure on probabilistic classes. Information Processing Letters\u00a0106(6), 241\u2013245 (2008)","journal-title":"Information Processing Letters"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/882116.882125","volume":"34","author":"A. Pavan","year":"2003","unstructured":"Pavan, A.: Comparison of reductions and completeness notions. SIGACT News\u00a034(2), 27\u201341 (2003)","journal-title":"SIGACT News"},{"key":"11_CR23","volume-title":"Dialogues","author":"Plato","year":"1989","unstructured":"Plato: Dialogues, vol.\u00a01. Yale University Press, New Haven and London (1989)"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2639","volume":"136","author":"M. Strauss","year":"1997","unstructured":"Strauss, M.: Measure on p: Strength of the notion. Information and Computation\u00a0136(1), 1\u201323 (1997)","journal-title":"Information and Computation"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01706069","volume":"6","author":"D.B. Thompson","year":"1972","unstructured":"Thompson, D.B.: Subrecursiveness: machine independent notions of computability in restricted time and storage. Mathematical Systems Theory\u00a06, 3\u201315 (1972)","journal-title":"Mathematical Systems Theory"},{"key":"11_CR26","unstructured":"Weihrauch, K.: Teilklassen primitiv-rekursiver Wortfunktionen. Ph.D. thesis, Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (1973)"}],"container-title":["Lecture Notes in Computer Science","Models of Computation in Context"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21875-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T04:50:31Z","timestamp":1554180631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21875-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218743","9783642218750"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21875-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}