{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:24:04Z","timestamp":1725798244408},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_107","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T18:17:11Z","timestamp":1406830631000},"page":"718-724","source":"Crossref","is-referenced-by-count":1,"title":["From Calculus to Algorithms without Errors"],"prefix":"10.1007","author":[{"given":"Norbert","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"107_CR1","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V. Brattka","year":"1998","unstructured":"Brattka, V., Hertling, P.: Feasible real random access machines. Journal of Complexity\u00a014(4), 490\u2013526 (1998)","journal-title":"Journal of Complexity"},{"key":"107_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"Brattka, V., Weihrauch, K.: Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. Theoretical Computer Science\u00a0219, 65\u201393 (1999)","journal-title":"Theoretical Computer Science"},{"key":"107_CR3","unstructured":"Kawamura, A., M\u00fcller, N., R\u00f6snick, C., Ziegler, M.: Computational Benefit of Smoothness: Rigorous Parameterized Complexity Analysis in High-Precision Numerics of Operators on Gevrey\u2019s Hierarchy (submitted)"},{"key":"107_CR4","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Computational Complexity of Real Functions. Birkh\u00e4user (1991)","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"107_CR5","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Polynomial-Time Computability in Analysis. In: Ershov, Y.L., et al. (eds.) Handbook of Recursive Mathematics, vol.\u00a02, pp. 1271\u20131317 (1998)","DOI":"10.1016\/S0049-237X(98)80052-9"},{"key":"107_CR6","doi-asserted-by":"crossref","unstructured":"Kreisel, G., Macintyre, A.: Constructive Logic versus Algebraization I. In: Troelstra, van Dalen (eds.) Proc. L.E.J. Brouwer Centenary Symposium, pp. 217\u2013260. North-Holland (1982)","DOI":"10.1016\/S0049-237X(09)70130-2"},{"issue":"2","key":"107_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1090\/S0273-0979-1988-15682-0","volume":"19","author":"P. Linz","year":"1988","unstructured":"Linz, P.: A critique of numerical analysis. Bulletin of the American Mathematical Society\u00a019(2), 407\u2013416 (1988)","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"1","key":"107_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jlap.2004.07.006","volume":"64","author":"C. Li","year":"2005","unstructured":"Li, C., Pion, S., Yap, C.: Recent progress in exact geometric computation. J. Log. Algebr. Program.\u00a064(1), 85\u2013111 (2005)","journal-title":"J. Log. Algebr. Program."},{"key":"107_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-18088-5_37","volume-title":"Automata, Languages and Programming","author":"N.T. M\u00fcller","year":"1987","unstructured":"M\u00fcller, N.T.: Uniform Computational Complexity of Taylor Series. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 435\u2013444. Springer, Heidelberg (1987)"},{"key":"107_CR10","unstructured":"M\u00fcller, N.T.: Constructive Aspects of Analytic Functions. In: Proc. Workshop on Computability and Complexity in Analysis (CCA), vol.\u00a0190, pp. 105\u2013114. InformatikBerichte FernUniversit\u00e4t Hagen (1995)"},{"key":"107_CR11","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":"N.T.. M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: Exact Arithmetic in C++. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 222\u2013252. Springer, Heidelberg (2001)"},{"key":"107_CR12","doi-asserted-by":"crossref","unstructured":"M\u00fcller, N.T., Korovina, M.: Making big steps in trajectories. In: Proc. 7th Int. Conf. on Computability and Complexity in Analysis (CCA 2010). Electronic Proceedings in Theoretical Computer Science, vol.\u00a024, pp. 106\u2013119 (2010)","DOI":"10.4204\/EPTCS.24.15"},{"key":"107_CR13","doi-asserted-by":"crossref","unstructured":"Pauly, A., Ziegler, M.: Relative Computability and Uniform Continuity of Relations. Journal of Logic and Analysis\u00a05 (2013)","DOI":"10.4115\/jla.2013.5.7"},{"issue":"3","key":"107_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"Specker, E.: Nicht konstruktiv beweisbare S\u00e4tze der Analysis. Journal of Symbolic Logic\u00a014(3), 145\u2013158 (1949)","journal-title":"Journal of Symbolic Logic"},{"key":"107_CR15","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 (1959)"},{"key":"107_CR16","unstructured":"Specker, E.: The fundamental theorem of algebra in recursive analysis. In: Constructive Aspects of the Fundamental Theorem of Algebra, pp. 321\u2013329. Wiley-Interscience (1969)"},{"key":"107_CR17","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable Analysis. Springer (2000)","DOI":"10.1007\/978-3-642-56999-9"},{"issue":"1","key":"107_CR18","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. Mathematical Logic Quarterly\u00a049(1), 3\u201321 (2003)","journal-title":"Mathematical Logic Quarterly"},{"issue":"6","key":"107_CR19","first-page":"801","volume":"14","author":"K. Weihrauch","year":"2008","unstructured":"Weihrauch, K.: The Computable Multi-Functions on Multi-represented Sets are Closed under Programming. Journal of Universal Computer Science\u00a014(6), 801\u2013844 (2008)","journal-title":"Journal of Universal Computer Science"},{"key":"107_CR20","doi-asserted-by":"crossref","unstructured":"Yap, C.-K.: On Guaranteed Accuracy Computation. In: Geometric Computation, pp. 322\u2013373. World Scientific Publishing (2004)","DOI":"10.1142\/9789812794833_0012"},{"key":"107_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-39053-1_51","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"C. Yap","year":"2013","unstructured":"Yap, C., Sagraloff, M., Sharma, V.: Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol.\u00a07921, pp. 434\u2013444. Springer, Heidelberg (2013)"},{"key":"107_CR22","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. Theoretical Computer Science\u00a0326, 187\u2013211 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"107_CR23","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/792538.792542","volume":"50","author":"K. Weihrauch","year":"2003","unstructured":"Weihrauch, K., Zhong, N.: Computability theory of generalized functions. Journal of the ACM\u00a050(4), 469\u2013505 (2003)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T09:13:00Z","timestamp":1558948380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}