{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:42:36Z","timestamp":1760132556962,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_19","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"215-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Computational Complexity of Real Powering and Improved Solving Linear Differential Equations"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Koswara","sequence":"first","affiliation":[]},{"given":"Svetlana","family":"Selivanova","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/070697926","volume":"38","author":"E Allender","year":"2009","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. SIAM J. Comput. 38(5), 1987\u20132006 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A Borodin","year":"1977","unstructured":"Borodin, A.: Relating time and space to size and depth. SIAM J. Comput. 6(4), 733\u2013744 (1977). https:\/\/doi.org\/10.1137\/0206054","journal-title":"SIAM J. Comput."},{"key":"19_CR3","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":"19_CR4","volume-title":"Partial Differential Equations, Graduate Studies in Mathematics","author":"L Evans","year":"1998","unstructured":"Evans, L.: Partial Differential Equations, Graduate Studies in Mathematics, vol. 19. American Mathematical Society, Providence (1998)"},{"key":"19_CR5","volume-title":"Difference Schemes: An Introduction to the Underlying Theory","author":"S Godunov","year":"1987","unstructured":"Godunov, S., Ryaben\u2019kii, V.: Difference Schemes: An Introduction to the Underlying Theory. Elsevier Science Ltd., New York (1987)"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0219012","volume":"19","author":"HJ Hoover","year":"1990","unstructured":"Hoover, H.J.: Feasible real functions and arithmetic circuits. SIAM J. Comput. 19(1), 182\u2013204 (1990). https:\/\/doi.org\/10.1137\/0219012","journal-title":"SIAM J. Comput."},{"issue":"5","key":"19_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.T., 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":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-662-44465-8_37","volume-title":"Mathematical Foundations of Computer Science 2014","author":"A Kawamura","year":"2014","unstructured":"Kawamura, A., Ota, H.: Small complexity classes for computable analysis. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 432\u2013444. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_37"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Kawamura, A., Ota, H., R\u00f6snick, C., Ziegler, M.: Computational complexity of smooth differential equations. Logical Methods in Computer Science 10, 1:6,15 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(1:6)2014","DOI":"10.2168\/LMCS-10(1:6)2014"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-662-57669-4_13","volume-title":"Logic, Language, Information, and Computation","author":"A Kawamura","year":"2018","unstructured":"Kawamura, A., Steinberg, F., Thies, H.: Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving. In: Moss, L.S., de Queiroz, R., Martinez, M. (eds.) WoLLIC 2018. LNCS, vol. 10944, pp. 223\u2013236. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57669-4_13"},{"issue":"8","key":"19_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":"19_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"KI Ko","year":"1991","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science, Birkh\u00e4user, Boston (1991)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E Mayr","year":"1982","unstructured":"Mayr, E., Meyer, A.: The complexity of the word problem for commutative semigroups and polynomial ideals. Adv. Math. 46, 305\u2013329 (1982)","journal-title":"Adv. Math."},{"key":"19_CR14","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":"19_CR15","doi-asserted-by":"publisher","unstructured":"Selivanova, S., Selivanov, V.L.: Computing solution operators of boundary-value problems for some linear hyperbolic systems of PDEs. Logical Meth. Comput. Sci. 13(4) (2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:13)2017","DOI":"10.23638\/LMCS-13(4:13)2017"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-94418-0_38","volume":"2018","author":"SV Selivanova","year":"2018","unstructured":"Selivanova, S.V., Selivanov, V.L.: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract). Proc. CiE 2018, 376\u2013385 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94418-0_38","journal-title":"Proc. CiE"},{"key":"19_CR17","series-title":"EATCS Text in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. EATCS Text in Theoretical Computer Science. Springer, Heidelberg (1999)"},{"key":"19_CR18","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)"},{"issue":"490","key":"19_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2013.04.008","volume":"489","author":"F Yu","year":"2013","unstructured":"Yu, F., Ko, K.I.: On parallel complexity of analytic functions. Theoret. Comput. Sci. 489(490), 48\u201357 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.04.008","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:02:50Z","timestamp":1710349370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}