{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T01:19:03Z","timestamp":1787707143779,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032096449","type":"print"},{"value":"9783032096456","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09645-6_2","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:06:49Z","timestamp":1761941209000},"page":"27-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Second-Order Parameterizations for\u00a0the\u00a0Complexity Theory of\u00a0Integrable Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2333-0884","authenticated-orcid":false,"given":"Aras","family":"Bacho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6734-7875","authenticated-orcid":false,"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0013091523000226","volume":"66","author":"RL Acosta Babb","year":"2023","unstructured":"Acosta Babb, R.L.: The $$\\text{L}^p$$ convergence of fourier series on triangular domains. Proc. Edinb. Math. Soc. 66(2), 453\u2013474 (2023). https:\/\/doi.org\/10.1017\/S0013091523000226","journal-title":"Proc. Edinb. Math. Soc."},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Bacho, A., Boche, H., Kutyniok, G.: Complexity blowup for solutions of the laplace and the diffusion equation. arXiv (2022). https:\/\/doi.org\/10.48550\/ARXIV.2212.00693","DOI":"10.48550\/ARXIV.2212.00693"},{"issue":"218","key":"2_CR3","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1090\/S0025-5718-97-00856-9","volume":"66","author":"DH Bailey","year":"1997","unstructured":"Bailey, D.H., Borwein, P.B., Plouffe, S.: On the rapid computation of various polylogarithmic constants. Math. Comput. 66(218), 903\u2013913 (1997). https:\/\/doi.org\/10.1090\/S0025-5718-97-00856-9","journal-title":"Math. Comput."},{"issue":"4\u20135","key":"2_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/MALQ.200710004","volume":"53","author":"V Brattka","year":"2007","unstructured":"Brattka, V., Dillhage, R.: Computability of compact operators on computable banach spaces with bases. Math. Log. Q. 53(4\u20135), 345\u2013364 (2007). https:\/\/doi.org\/10.1002\/MALQ.200710004","journal-title":"Math. Log. Q."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Brau\u00dfe, F., Collins, P., Ziegler, M.: Computer science for continuous data - survey, vision, theory, and practice of a computer ANALYSIS system. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) Proceedings of 24th CASC. LNCS, vol. 13366, pp. 62\u201382. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14788-3_5","DOI":"10.1007\/978-3-031-14788-3_5"},{"issue":"3","key":"2_CR6","first-page":"318","volume":"53","author":"M Braverman","year":"2006","unstructured":"Braverman, M., Cook, S.A.: Computing over the reals: foundations for scientific computing. Not. AMS 53(3), 318\u2013329 (2006)","journal-title":"Not. AMS"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Br\u00e9zis, H.: Functional Analysis, Sobolev Spaces and Partial Differential Equations. Springer, New York (2011)","DOI":"10.1007\/978-0-387-70914-7"},{"key":"2_CR8","unstructured":"Cheney, E.W.: Introduction to Approximation Theory, 2nd edn. AMS Chelsea Publishing, New York (2000)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Duoandikoetxea, J.: Fourier Analysis, GSM, vol.\u00a029. AMS (2001)","DOI":"10.1090\/gsm\/029"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"330","DOI":"10.2307\/1970864","volume":"94","author":"C Fefferman","year":"1971","unstructured":"Fefferman, C.: The multiplier problem for the ball. Ann. Math. 94(2), 330\u2013336 (1971). https:\/\/doi.org\/10.2307\/1970864","journal-title":"Ann. Math."},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0001-8708(84)90019-7","volume":"53","author":"H Friedman","year":"1984","unstructured":"Friedman, H.: The computational complexity of maximization and integration. Adv. Math. 53, 80\u201398 (1984). https:\/\/doi.org\/10.1016\/0001-8708(84)90019-7","journal-title":"Adv. Math."},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"BM Kapron","year":"1996","unstructured":"Kapron, B.M., Cook, S.A.: A new characterization of type-2 feasibility. SIAM J. Comput. 25(1), 117\u2013132 (1996). https:\/\/doi.org\/10.1137\/S0097539794263452","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00037-010-0286-0","volume":"19","author":"A Kawamura","year":"2010","unstructured":"Kawamura, A.: Lipschitz continuous ordinary differential equations are polynomial-space complete. Comput. Complex. 19(2), 305\u2013332 (2010). https:\/\/doi.org\/10.1007\/s00037-010-0286-0","journal-title":"Comput. Complex."},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Cook, S.A.: Complexity theory for operators in analysis. ACM Trans. Comput. Theory 4(2), 5:1\u20135:24 (2012). https:\/\/doi.org\/10.1145\/2189778.2189780","DOI":"10.1145\/2189778.2189780"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Steinberg, F., Ziegler, M.: Complexity theory of (functions on) compact metric spaces. In: Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016), p.\u00a010. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2933575.2935311","DOI":"10.1145\/2933575.2935311"},{"issue":"8","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1017\/S096012951600013X","volume":"27","author":"A Kawamura","year":"2017","unstructured":"Kawamura, A., Steinberg, F., Ziegler, M.: On the computational complexity of the Dirichlet problem for Poisson\u2019s equation. Math. Struct. Comput. Sci. 27(8), 1437\u20131465 (2017). https:\/\/doi.org\/10.1017\/S096012951600013X","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science, Birkh\u00e4user, Boston (1991)","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"2_CR19","volume-title":"Applied Proof Theory: Proof Interpretations and Their Use in Mathematics","author":"U Kohlenbach","year":"2008","unstructured":"Kohlenbach, U.: Applied Proof Theory: Proof Interpretations and Their Use in Mathematics. Springer, Berlin (2008)"},{"issue":"2","key":"2_CR20","first-page":"3","volume":"14","author":"A Kolmogorov","year":"1959","unstructured":"Kolmogorov, A., Tikhomirov, V.: $$\\cal{E} $$-entropy and $$\\cal{E} $$-capacity of sets in functional spaces. Uspekhi Mat. Nauk 14(2), 3\u201386 (1959)","journal-title":"Uspekhi Mat. Nauk"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Koswara, I., Pogudin, G., Selivanova, S., Ziegler, M.: Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations. J. Complex. 101727 (2023). https:\/\/doi.org\/10.1016\/j.jco.2022.101727","DOI":"10.1016\/j.jco.2022.101727"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","volume":"38","author":"C Kreitz","year":"1985","unstructured":"Kreitz, C., Weihrauch, K.: Theory of representations. Theoret. Comput. Sci. 38, 35\u201353 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Kunkle, D.: Type-2 computability on spaces of integrable functions. Math. Logic Q. 50(4,5), 417\u2013430 (2004)","DOI":"10.1002\/malq.200310109"},{"key":"2_CR24","unstructured":"Lim, D., Selivanova, S., Ziegler, M.: What is a polynomial-time computable L$$^2$$ function? In: Proceedings of 17th International Conference on Computability and Complexity in Analysis (CCA), Bologna (Italy), pp. 41\u201342 (2020). http:\/\/cca-net.de\/cca2020\/CCA2020Abstracts.pdf"},{"key":"2_CR25","unstructured":"Lim, D., Ziegler, M.: Degrees of second and higher-order polynomials. arXiv (2023). https:\/\/arxiv.org\/abs\/2305.03439"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Lim, D., Ziegler, M.: Quantitative coding and complexity theory of continuous data, part I. J. ACM 72(1) (2025). https:\/\/doi.org\/10.1145\/3705609","DOI":"10.1145\/3705609"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Park, S., et al.: Semantics, specification logic, and Hoare logic of exact real computation. Log. Methods Comput. Sci. 20(2) (2024). https:\/\/doi.org\/10.46298\/lmcs-20(2:17)2024","DOI":"10.46298\/lmcs-20(2:17)2024"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0003-4843(79)90021-4","volume":"17","author":"MB Pour-El","year":"1979","unstructured":"Pour-El, M.B., Richards, J.I.: Computable ordinary differential equation which possesses no computable solution. Ann. Math. Logic 17, 61\u201390 (1979)","journal-title":"Ann. Math. Logic"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0001-8708(81)90001-3","volume":"39","author":"MB Pour-El","year":"1981","unstructured":"Pour-El, M.B., Richards, J.I.: The wave equation with computable initial data such that its unique solution is not computable. Adv. Math. 39, 215\u2013239 (1981)","journal-title":"Adv. Math."},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin (1989)","DOI":"10.1007\/978-3-662-21717-7"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, M.: Admissible representations in computable analysis. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J. (eds.) Logical Approaches to Computational Barriers. LNCS, vol.\u00a03988, pp. 471\u2013480. Springer, Berlin (2006)","DOI":"10.1007\/11780342_48"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-85165-1_21","volume-title":"Computer Algebra in Scientific Computing","author":"S Selivanova","year":"2021","unstructured":"Selivanova, S., Steinberg, F., Thies, H., Ziegler, M.: Exact real computation of solution operators for linear analytic systems of partial differential equations. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2021. LNCS, vol. 12865, pp. 370\u2013390. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85165-1_21"},{"key":"2_CR33","unstructured":"Specker, E.: Der Satz vom maximum in der rekursiven analysis. In: Heyting, A. (ed.) Constructivity in Mathematics. Studies in Logic and the Foundations of Mathematics, pp. 254\u2013265. North-Holland, Amsterdam (1959)"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Steinberg, F.: Complexity theory for spaces of integrable functions. Log. Methods Comput. Sci. 13(3), Paper No. 21, 39 (2017). https:\/\/doi.org\/10.23638\/LMCS-13(3:21)2017","DOI":"10.23638\/LMCS-13(3:21)2017"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Sun, S., Zhong, N., Ziegler, M.: Computability of the solutions to navier-stokes equations via effective approximation. In: Du, D., Wang, J. (eds.) Complexity and Approximation - In Memory of Ker-I Ko. LNCS, vol. 12000, pp. 80\u2013112. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-41672-0_7","DOI":"10.1007\/978-3-030-41672-0_7"},{"issue":"2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1305\/NDJFL\/1093635419","volume":"31","author":"M Townsend","year":"1990","unstructured":"Townsend, M.: Complexity for type-2 relations. Notre Dame J. Formal Log. 31(2), 241\u2013262 (1990). https:\/\/doi.org\/10.1305\/NDJFL\/1093635419","journal-title":"Notre Dame J. Formal Log."},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)","DOI":"10.1007\/978-3-642-56999-9"},{"issue":"1","key":"2_CR38","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."},{"issue":"2","key":"2_CR39","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1112\/S0024611502013643","volume":"85","author":"K Weihrauch","year":"2002","unstructured":"Weihrauch, K., Zhong, N.: Is wave propagation computable or can wave computers beat the Turing machine? Proc. Lond. Math. Soc. 85(2), 312\u2013332 (2002)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(98)00302-8","volume":"219","author":"N Zhong","year":"1999","unstructured":"Zhong, N.: Computability structure of the sobolev spaces and its applications. Theoret. Comput. Sci. 219, 487\u2013510 (1999)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09645-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T00:25:10Z","timestamp":1787703910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09645-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032096449","9783032096456"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09645-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}