{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T04:58:27Z","timestamp":1780117107305,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540421979","type":"print"},{"value":"9783540453352","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45335-0_14","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T17:49:27Z","timestamp":1195062567000},"page":"222-252","source":"Crossref","is-referenced-by-count":51,"title":["The iRRAM: Exact Arithmetic in C++"],"prefix":"10.1007","author":[{"given":"Norbert Th.","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"issue":"181","key":"14_CR1","first-page":"238","volume":"50","author":"D.H. Bailey","year":"1988","unstructured":"D.H. Bailey, The computation of \u03c0 to 29,360,000 Decimal Digits Using Borweins Quartically Convergent Algorithm Mathematics of Computation Vol. 50 Number 181 (1988) 238\u2013296","journal-title":"Mathematics of Computation"},{"key":"14_CR2","volume-title":"A study in analytic number theory","author":"J.M. Borwein","year":"1987","unstructured":"J.M. Borwein and P.B. Borwein, Pi and the AGM, A study in analytic number theory, Wiley, New York, 1987"},{"key":"14_CR3","unstructured":"H. Boehm and R. Cartwright, Exact Real Arithmetic: Formulating real numbers as functions. In T. D., editor, Research Topics in Functional Programming, 43\u201364 (Addison-Wesley, 1990)"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bulletin of the AMS 21, 1, July 1989","journal-title":"Bulletin of the AMS"},{"key":"14_CR5","first-page":"126","volume-title":"Proc. Seminar on Complexity of Computational Problem Solving","author":"R.P. Brent","year":"1975","unstructured":"R.P. Brent, The complexity of multiple precision arithmetic, Proc. Seminar on Complexity of Computational Problem Solving, Queensland U. Press, Brisbane, Australia (1975) 126\u2013165"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/321941.321944","volume":"23","author":"R.P. Brent","year":"1976","unstructured":"R.P. Brent, Fast multiple precision evaluation of elementary functions, J. ACM 23 (1976) 242\u2013251","journal-title":"J. ACM"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/355769.355775","volume":"4","author":"R.P. Brent","year":"1978","unstructured":"R.P. Brent, A Fortran multiple precision package, ACM Trans. Math. Software 4 (1978), pp 57\u201370","journal-title":"ACM Trans. Math. Software"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(95)00249-9","volume":"162","author":"V. Brattka","year":"1996","unstructured":"V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoret. Comput. Sci. 162 (1996),47\u201377","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR9","unstructured":"V. Brattka and P. Hertling, Feasible Real Random Access Machines, Informatik Berichte 193-12\/1995, FernUniversit\u00e4t Hagen"},{"key":"14_CR10","unstructured":"V. Brattka and P. Hertling, Continuity and Computability of Relations, Informatik Berichte 164-9\/1994, FernUniversit\u00e4tHagen"},{"key":"14_CR11","unstructured":"V. Brattka, Recursive and Computable Operations over Topological Structures, Thesis, Informatik Berichte 255-7\/1999, FernUniversit\u00e4tHagen"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2307\/1995359","volume":"142","author":"S.A. Cook","year":"1969","unstructured":"S.A. Cook and S.O. Aanderaa,On the minimum computation time of functions, Trans. Amer.Math. Soc. 142 (1969) 291\u2013314","journal-title":"Trans. Amer.Math. Soc."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"A. Edalat and P. Potts, A new representation for exact real numbers, Proc. ofMathematical Foundations of Programming Semantics 13, Electronic notes in Theoretical Computer Science 6, Elsevier Science B.V., 1997, URL: http:\/\/www.elsevier.nl\/locate\/entcs\/volume6.html","DOI":"10.1016\/S1571-0661(05)80166-5"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(74)80047-4","volume":"9","author":"M.J. Fischer","year":"1974","unstructured":"M.J. Fischer and L.J. Stockmeyer, Fast on-line integer multiplication, J. Comput. System Scis. 9 (1974) 317\u2013331","journal-title":"J. Comput. System Scis."},{"key":"14_CR15","unstructured":"T. Granlund, GMP 3.1.1, http:\/\/www.swox.com\/gmp\/"},{"key":"14_CR16","unstructured":"P. Gowland and D. Lester, The Correctness of an Implementation of Exact Arithmetic, 4th Conference on Real Numbers and Computers, 2000, Dagstuhl, 125\u2013140"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"S. Heinrich, E. Novak et al., The Inverse of the Star-Discrepancy depends linearly on the Dimension, Acta Arithmetica, to appear","DOI":"10.4064\/aa96-3-7"},{"key":"14_CR18","volume-title":"C-XSC, a C++ Class Library for Extended Scientific Computing","author":"R. Klatte","year":"1993","unstructured":"R. Klatte, U. Kulisch et al., C-XSC, a C++ Class Library for Extended Scientific Computing (Springer, Berlin 1993)"},{"key":"14_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K. Ko","year":"1991","unstructured":"K. Ko, Complexity Theory of Real Functions, (Birkh\u00e4user, Boston 1991)"},{"key":"14_CR20","unstructured":"U. Kulisch, Memorandum \u00fcber Computer, Arithmetik und Numerik (Universit\u00e4t Karlsruhe, Institut f\u00fcr angewandteMathematik)"},{"key":"14_CR21","unstructured":"V. M\u00e9nissier-Morain, Arbitrary precision real arithmetic: design and algorithms, J. Symbolic Computation, 1996, 11"},{"key":"14_CR22","unstructured":"N.Th. M\u00fcller, Untersuchungen zur Komplexit\u00e4t reeller Funktionen, Dissertation (Fern-Universit\u00e4t Hagen, 1988)"},{"key":"14_CR23","unstructured":"N.Th. M\u00fcller, Polynomial Time Computation of Taylor Series,Proc. 22 JAIIO-PANEL\u2019 93, Part 2, Buenos Aires, 1993, 259\u2013281 (also available at http:\/\/www.informatik.uni-trier.de\/~mueller )"},{"key":"14_CR24","first-page":"59","volume":"96-44","author":"N.Th. M\u00fcller","year":"1996","unstructured":"N.Th. M\u00fcller, Towards a real Real RAM: a Prototype using C++, (preliminary version), Second Workshop on Constructivity and Complexity in Analysis, Forschungsbericht Mathematik-Informatik, Universit\u00e4t Trier 96-44, Seiten 59\u201366 (1996) (also available at http:\/\/www.informatik.uni-trier.de\/~mueller )","journal-title":"Towards a real Real RAM: a Prototype using C++"},{"key":"14_CR25","unstructured":"N.Th. M\u00fcller, Towards a real RealRAM: a Prototype using C++, Proc. 6th International Conference on Numerical Analysis, Plovdiv, 1997"},{"key":"14_CR26","unstructured":"N.Th. M\u00fcller, Implementing limits in an interactive RealRAM, 3rd Conference on Real Numbers and Computers, 1998, Paris, 13\u201326"},{"key":"14_CR27","unstructured":"M. Riordan, ftp:\/\/ripem.msu.edu\/pub\/bignum\/BIGNUMS.TXT"},{"key":"14_CR28","first-page":"1","volume":"92","author":"A. Sch\u00f6nhage","year":"1990","unstructured":"A. Sch\u00f6nhage, Numerik analytischer Funktionen und Komplexit\u00e4t, Jber. d. Dt. Math.-Verein. 92 (1990) 1\u201320","journal-title":"Jber. d. Dt. Math.-Verein."},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(98)00297-7","volume":"219","author":"J.V. Tucker","year":"1999","unstructured":"J.V. Tucker, J.I. Zucker, Computation by \u2018While\u2019 programs on topological partial algebras, Theoretical Computer Science 219 (1999) 379\u2013420","journal-title":"Theoretical Computer Science"},{"key":"14_CR30","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch, Computability (volume 9 of: EATCS Monographs on Theoretical Computer Science), (Springer, Berlin, 1987)"},{"key":"14_CR31","unstructured":"K. Weihrauch, A Simple Introduction to Computable Analysis, Informatik Berichte 171-2\/1995, FernUniversit\u00e4tHagen"},{"key":"14_CR32","unstructured":"K. Weihrauch,A Foundation for ComputableAnalysis, Proc.DMTCS\u201996, (Springer, Singapore, 1997) 66\u201389"},{"key":"14_CR33","unstructured":"Zi00.P. Zimmermann, MPFR: A Library for Multiprecision Floating-Point Arithmetic with Exact Rounding, 4th Conference on Real Numbers and Computers, 2000, Dagstuhl, 89\u201390, see also http:\/\/www.loria.fr\/projets\/mpfr\/"}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity in Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45335-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T12:12:49Z","timestamp":1556971969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-45335-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}