{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:13:13Z","timestamp":1762377193536,"version":"3.44.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087394"},{"type":"electronic","value":"9783031087400"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08740-0_25","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T14:33:51Z","timestamp":1656167631000},"page":"299-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computational Complexity of\u00a0Classical Solutions of\u00a0Partial Differential Equations"],"prefix":"10.1007","author":[{"given":"Svetlana","family":"Selivanova","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-22993-0_18","volume-title":"Mathematical Foundations of Computer Science 2011","author":"O Bournez","year":"2011","unstructured":"Bournez, O., Gra\u00e7a, D.S., Pouly, A.: Solving analytic differential equations in polynomial time over unbounded domains. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 170\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_18"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-0-387-68546-5_18","volume-title":"New Computational Paradigms: Changing Conceptions of What Is Computable","author":"V Brattka","year":"2008","unstructured":"Brattka, V., Hertling, P., Weihrauch, K.: A tutorial on computable analysis. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms: Changing Conceptions of What Is Computable, pp. 425\u2013491. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-68546-5_18"},{"issue":"3","key":"25_CR3","first-page":"318","volume":"53","author":"M Braverman","year":"2006","unstructured":"Braverman, M., Cook, S.A.: Computing over the reals: foundations for scientific computing. Notices AMS 53(3), 318\u2013329 (2006)","journal-title":"Notices AMS"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Ershov, Y., Goncharov, S.: Constructive Models. Novosibirsk, Scientific Book (in Russian, there is an English Translation) (1999)","DOI":"10.1007\/978-1-4615-4305-3_2"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/1521-3870(200101)47:1<93::AID-MALQ93>3.0.CO;2-C","volume":"47","author":"W Gay","year":"2001","unstructured":"Gay, W., Zhang, B.Y., Zhong, N.: Computability of solutions of the Korteweg-de Vries equation. Math. Log. Q. 47(1), 93\u2013110 (2001)","journal-title":"Math. Log. Q."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Gra\u00e7a, D., Zhong, N.: Computability of differential equations. In: Handbook of Computability and Complexity in Analysis (Editors: Vasco Brattka and Peter Hertling), pp. 71\u201399. Theory and Applications of Computability (2021)","DOI":"10.1007\/978-3-030-59234-9_3"},{"issue":"2","key":"25_CR7","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":"25_CR8","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Cook, S.: Complexity theory for operators in analysis. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 495\u2013502. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1806689.1806758","DOI":"10.1145\/1806689.1806758"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Ota, H., R\u00f6snick, C., Ziegler, M.: Computational complexity of smooth differential equations. Log. Methods Comput. Sci. 10(1:6), 15 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(1:6)2014","DOI":"10.2168\/LMCS-10(1:6)2014"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Steinberg, F., Thies, H.: Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving. In: Proc 25th International Workshop on Logic, Language, Information, and Computation (WOLLIC), pp. 223\u2013236 (2018). https:\/\/doi.org\/10.1007\/978-3-662-57669-4_13","DOI":"10.1007\/978-3-662-57669-4_13"},{"issue":"8","key":"25_CR11","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":"25_CR12","unstructured":"Kawamura, A., Thies, H., Ziegler, M.: Average-case polynomial-time computability of hamiltonian dynamics. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, 27\u201331 August 2018, Liverpool, UK. LIPIcs, vol. 117, pp. 30:1\u201330:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"25_CR13","unstructured":"Kawamura, A., Ziegler, M.: Invitation to real complexity theory: algorithmic foundations to reliable numerics with bit-costs (2018). https:\/\/arxiv.org\/abs\/1801.07108"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K Ko","year":"1982","unstructured":"Ko, K., Friedman, H.: Computational complexity of real functions. Theoret. Comput. Sci. 20(3), 323\u2013352 (1982). https:\/\/doi.org\/10.1016\/S0304-3975(82)80003-0","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR15","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":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-79416-3_13","volume-title":"Computer Science \u2013 Theory and Applications","author":"I Koswara","year":"2021","unstructured":"Koswara, I., Pogudin, G., Selivanova, S., Ziegler, M.: Bit-complexity of solving systems of linear evolutionary partial differential equations. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 223\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_13"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Koswara, I., Pogudin, G., Selivanova, S., Ziegler, M.: Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations. J. Complex. (2022, submitted)","DOI":"10.1016\/j.jco.2022.101727"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-19955-5_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"I Koswara","year":"2019","unstructured":"Koswara, I., Selivanova, S., Ziegler, M.: Computational complexity of real powering and improved solving linear differential equations. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 215\u2013227. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_19"},{"key":"25_CR19","unstructured":"Lim, D., Selivanova, S., Ziegler, M.: Complexity and coding theory of hilbert spaces: what is a polynomial-time computable $$l_2$$ function? In: Proceedings of Computability and Complexity in Analysis (CCA 2020), pp. 41\u201342 (2020)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"NT M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: exact arithmetic in C++. In: Blanck, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 222\u2013252. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45335-0_14"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0898-1221(90)90235-C","volume":"20","author":"V Pan","year":"1990","unstructured":"Pan, V., Reif, J.: The bit-complexity of discrete solutions of partial differential equations: compact multigrid. Comput. Math. Appl. 20, 9\u201316 (1990)","journal-title":"Comput. Math. Appl."},{"key":"25_CR22","unstructured":"Park, S., et al.: Foundation of computer (algebra) analysis systems: semantics, logic, programming, verification (2020). https:\/\/arxiv.org\/abs\/1608.05787"},{"issue":"2\u20133","key":"25_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF03186542","volume":"26","author":"M Plum","year":"2009","unstructured":"Plum, M.: Computer-assisted proofs for semilinear elliptic boundary value problems. Japan J. Indust. Appl. Math. 26(2\u20133), 419\u2013442 (2009)","journal-title":"Japan J. Indust. Appl. Math."},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2016.02.002","volume":"626","author":"A Pouly","year":"2016","unstructured":"Pouly, A., Gra\u00e7a, D.S.: Computational complexity of solving polynomial differential equations over unbounded domains. Theoret. Comput. Sci. 626, 67\u201382 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.02.002","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Pour-El, M., Richards, J.: Computability in Analysis and Physics. Cambridge University Press, Cambridge (2017)","DOI":"10.1017\/9781316717325"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Selivanova, S., Selivanov, V.: Computing solution operators of boundary-value problems for some linear hyperbolic systems of PDEs. Log. Methods Comput. Sci. 13(4:13), 1\u201331 (2017)","DOI":"10.23638\/LMCS-13(4:13)2017"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-85165-1_20","volume-title":"Computer Algebra in Scientific Computing","author":"V Selivanov","year":"2021","unstructured":"Selivanov, V., Selivanova, S.: Primitive recursive ordered fields and some applications. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2021. LNCS, vol. 12865, pp. 353\u2013369. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85165-1_20"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Selivanova, S., Selivanov, V.: Primitive recursive ordered fields and some applications (2021). arXiv:2010.10189","DOI":"10.1007\/978-3-030-85165-1_20"},{"key":"25_CR29","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"},{"issue":"2","key":"25_CR30","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3233\/COM-180215","volume":"10","author":"S Selivanova","year":"2021","unstructured":"Selivanova, S., Selivanov, V.: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision. Computability 10(2), 123\u2013140 (2021). https:\/\/doi.org\/10.3233\/COM-180215","journal-title":"Computability"},{"key":"25_CR31","doi-asserted-by":"publisher","unstructured":"Selivanova, S., Selivanov, V.L.: Computing solution operators of boundary-value problems for some linear hyperbolic systems of PDEs. Log. Methods Comput. Sci. 13(4) (2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:13)2017","DOI":"10.23638\/LMCS-13(4:13)2017"},{"key":"25_CR32","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":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-41672-0_7","volume-title":"Complexity and Approximation","author":"S-M Sun","year":"2020","unstructured":"Sun, S.-M., Zhong, N., Ziegler, M.: Computability of the solutions to navier-stokes equations via effective approximation. In: Du, D.-Z., Wang, J. (eds.) Complexity and Approximation. LNCS, vol. 12000, pp. 80\u2013112. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41672-0_7"},{"key":"25_CR34","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, Berlin (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"issue":"1","key":"25_CR35","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":"1\u20133","key":"25_CR36","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2004.06.022","volume":"326","author":"M Ziegler","year":"2004","unstructured":"Ziegler, M., Brattka, V.: Computability in linear algebra. Theoret. Comput. Sci. 326(1\u20133), 187\u2013211 (2004)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Revolutions and Revelations in Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08740-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:12:47Z","timestamp":1757092367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08740-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087394","9783031087400"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08740-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Swansea","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.swansea.ac.uk\/cie2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}