{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:07Z","timestamp":1742913127184,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319328584"},{"type":"electronic","value":"9783319328591"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-32859-1_43","type":"book-chapter","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T11:12:06Z","timestamp":1460718726000},"page":"505-519","source":"Crossref","is-referenced-by-count":1,"title":["Average-Case Bit-Complexity Theory of Real Functions"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Schr\u00f6der","sequence":"first","affiliation":[]},{"given":"Florian","family":"Steinberg","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"issue":"C","key":"43_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ic.2015.03.005","volume":"242","author":"V Brattka","year":"2015","unstructured":"Brattka, V., H\u00f6lzl, R., Gherardi, G.: Probabilistic computability and choice. Inf. Comput. 242(C), 249\u2013286 (2015)","journal-title":"Inf. Comput."},{"issue":"6","key":"43_CR2","first-page":"956","volume":"146","author":"V Bosserhoff","year":"2008","unstructured":"Bosserhoff, V.: Notions of probabilistic computability on represented spaces. J. Univ. Comput. Sci. 146(6), 956\u2013995 (2008)","journal-title":"J. Univ. Comput. Sci."},{"issue":"1","key":"43_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000004","volume":"2","author":"Andrej Bogdanov","year":"2006","unstructured":"Bogdanov, A., Trevisan, L.: Average-case complexity. Found. Trends Theor. Comput. Sci. 2(1), 1\u2013106 (2006). \n                      arXiv:cs\/0606037","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"issue":"3","key":"43_CR4","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00224-009-9231-5","volume":"46","author":"A Coja-Oghlan","year":"2010","unstructured":"Coja-Oghlan, A., Krivelevich, M., Vilenchik, D.: Why almost all \n                      \n                        \n                      \n                      \n$$k$$\n\n                    -colorable graphs are easy to color. Theor. Comput. Syst. 46(3), 523\u2013565 (2010)","journal-title":"Theor. Comput. Syst."},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-22670-0_21","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Notes on Levin\u2019s theory of average-case complexity. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. LNCS, vol. 6650, pp. 233\u2013247. Springer, Heidelberg (2011)"},{"key":"43_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"M Habib","year":"1998","unstructured":"Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B.: Probabilistic Methods for Algorithmic Discrete Mathematics. Springer, Heidelberg (1998)"},{"issue":"5","key":"43_CR7","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jco.2015.05.001","volume":"31","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., M\u00fcller, N., R\u00f6snick, C., Ziegler, M.: Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey\u2019s hierarchy. J. Complex. 31(5), 689\u2013714 (2015)","journal-title":"J. Complex."},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K-I Ko","year":"1982","unstructured":"Ko, K.-I., Friedman, H.: Computational complexity of real functions. Theor. Comput. Sci. 20, 323\u2013352 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Computational Complexity of Real Functions","author":"K-I Ko","year":"1991","unstructured":"Ko, K.-I.: Computational Complexity of Real Functions. Birkh\u00e4user, Boston (1991)"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-10(1:6)2014","volume":"10","author":"A Kawamura","year":"2014","unstructured":"Kawamura, A., Ota, H., R\u00f6snick, C., Ziegler, M.: Computational complexity of smooth differential equations. Log. Methods Comput. Sci. 10, 1 (2014)","journal-title":"Log. Methods Comput. Sci."},{"key":"43_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (1997)"},{"key":"43_CR12","series-title":"Lecture Notes in Mathematics","volume-title":"Average-Case Analysis of Numerical Problems","year":"2000","unstructured":"Ritter, K. (ed.): Average-Case Analysis of Numerical Problems. Lecture Notes in Mathematics, vol. 1733. Springer, Heidelberg (2000)"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/malq.200310111","volume":"50","author":"M Schr\u00f6der","year":"2004","unstructured":"Schr\u00f6der, M.: Spaces allowing type-2 complexity theory revisited. Math. Log. Q. 50, 443\u2013459 (2004)","journal-title":"Math. Log. Q."},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1016\/j.jco.2006.05.003","volume":"22","author":"M Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, M., Simpson, A.: Representing probability measures using probabilistic processes. J. Complex. 22, 768\u2013782 (2006)","journal-title":"J. Complex."},{"key":"43_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)"},{"issue":"1","key":"43_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/malq.200310001","volume":"49","author":"K Weihrauch","year":"2003","unstructured":"Weihrauch, K.: Computational complexity on computable metric spaces. Math. Log. Q. 49(1), 3\u201321 (2003)","journal-title":"Math. Log. Q."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32859-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:48:22Z","timestamp":1559422102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32859-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319328584","9783319328591"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32859-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}