{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215081,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421979"},{"type":"electronic","value":"9783540453352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45335-0_15","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T17:49:27Z","timestamp":1195062567000},"page":"253-272","source":"Crossref","is-referenced-by-count":5,"title":["The Uniformity Conjecture"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Richardson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"A. Baker, Transcendental number theory, CUP, 1975","DOI":"10.1017\/CBO9780511565977"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1137\/1030134","volume":"30","author":"J.M. Borwein","year":"1988","unstructured":"J.M Borwein and P.B. Borwein, On the Complexity of Familiar Functions and Numbers, SIAM Review, Vol 30, No 4, Dec 1988, pp 589\u2013601","journal-title":"SIAM Review"},{"key":"15_CR3","unstructured":"Blum, Cucker, Shub, Smale, Real Complexity and Computation, Springer"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"440","DOI":"10.2307\/2589148","volume":"106","author":"T.Y. Chow","year":"1999","unstructured":"T.Y. Chow, What is a Closed-Form Number?, American Mathematical Monthly, Vol 106, No 5, 1999, pp 440\u2013448","journal-title":"American Mathematical Monthly"},{"key":"15_CR5","unstructured":"J. Davenport, Y. Siret, and E. Tournier, Computer Algebra, Academic Press, 1993."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0022-314X(87)90088-6","volume":"26","author":"B.M.M. DeWeger","year":"1987","unstructured":"B.M.M. DeWeger, Solving exponential Diophantine equations using lattice basis reduction algorithms, J. Number Theory 26 (1987) 325\u2013367.","journal-title":"J. Number Theory"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/0218059","volume":"18","author":"J. H\u00e5stad","year":"1989","unstructured":"J. H\u00e5stad, B. Just, J.C. Lagarias, and C.P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, SIAM J. Comput. 18 (1989). pp 859\u2013881.","journal-title":"SIAM J. Comput."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"M. Hindry and J. Silverman, Diophantine Geometry, An Introduction, Springer Graduate Texts in Mathematics, 2000","DOI":"10.1007\/978-1-4612-1210-2"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"E. Hlawka, J. Schoissengeier, and R. Taschner, Geometric and Analytic Number Theory. Springer Verlag, 1991","DOI":"10.1007\/978-3-642-75306-0"},{"key":"15_CR10","unstructured":"Namhyun Hur and James H. Davenport, An exact Real Arithmetic with Equality Determination, draft, (Bath U)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"J.R. Johnson, Real Algebraic Number Computation using Interval Arithmetic, ISSAC\u2019 92, pp 195\u2013205","DOI":"10.1145\/143242.143311"},{"issue":"1","key":"15_CR12","first-page":"177","volume":"54","author":"P. Koiran","year":"1997","unstructured":"P. Koiran, A weak version of the Blum, Shub and Smale Model, FOCS\u2019 93, pp 486-495; also in JCSS 54(1), pp 177\u2013189, 1997","journal-title":"A weak version of the Blum, Shub and Smale Model"},{"key":"15_CR13","unstructured":"S. Langley and D. Richardson, Bounds on Algebraic Expressions, preprint"},{"key":"15_CR14","unstructured":"S. Lang, Introduction to Transcendental Numbers, Addison Wesley, 1966"},{"key":"15_CR15","first-page":"173","volume":"4","author":"R. Loos","year":"1982","unstructured":"R. Loos, Computing in Algebraic Extensions, Computing, 4, (Suppl) pp 173\u2013187, 1982","journal-title":"Computing"},{"key":"15_CR16","unstructured":"Martin Sombra, Estimaciones para el Teorema de Ceros de Hilbert, Tesis, Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, 1998."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01446571","volume":"289","author":"P. Philippon","year":"1991","unstructured":"P. Philippon, Sur des hauteurs alternatives, I, Math Ann. 289 (1991), pp 255\u2013283; II Ann. Inst. Fourier 44 (1994), pp 1043-1065; III, J. Math. Pures Appl. 74 (1995), pp 345-365","journal-title":"Math Ann"},{"issue":"2","key":"15_CR18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0004972700032937","volume":"59","author":"P. Philippon","year":"1999","unstructured":"P. Philippon, Quelques remarques sur des questions d\u2019approximation diophantine, Bull Austral. Math. Soc., Vol 59(2), (1999), pp 323\u2013334.","journal-title":"Bull Austral. Math. Soc."},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0004972700022127","volume":"61","author":"P. Philippon","year":"2000","unstructured":"P. Philippon, Addendum a quelques remarques sur des questions d\u2019approximation diophantine, Bull Austral. Math. Soc., vol 61(1), (2000), pp 167\u2013169.","journal-title":"Bull Austral. Math. Soc."},{"key":"15_CR20","unstructured":"M. Pohst, Algorithmic Algebraic Number Theory"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1006\/jsco.1997.0159","volume":"24","author":"M. Pohst","year":"1997","unstructured":"M. Pohst, On Validated Computing in Algebraic Number Fields, J. Symbolic Computation 24, pp 657\u2013666, 1997","journal-title":"J. Symbolic Computation"},{"key":"15_CR22","unstructured":"A. Macintyre and A. Wilkie, On the decidability of the real exponential field, in Kreiseliana, About and Around Georg Kreisel, A.K. Peters, 1996, pp 441\u2013467."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"M. Mignotte, Mathematics for Computer Algebra, Springer Verlag, 1991","DOI":"10.1007\/978-1-4613-9171-5"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1006\/jsco.1997.0157","volume":"24","author":"D. Richardson","year":"1997","unstructured":"D. Richardson, How to Recognise Zero, J. Symbolic Computation (1997), 24, pp 627\u2013645","journal-title":"J. Symbolic Computation"},{"key":"15_CR25","unstructured":"D. Richardson, Multiplicative Independence of Algebraic Numbers and Expressions, Mega2000 conference Bath June 2000, to appear in Journal of Pure and Applied Algebra."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"V.G. Sprindzhuk, Achievements and Problems in Diophantine Approximation Theory, Russian Mathematical Surveys 35 (4), 1980, pp 1\u201380","DOI":"10.1070\/RM1980v035n04ABEH001861"},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1006\/jsco.1997.0158","volume":"24","author":"A. W. Strsebonski","year":"1997","unstructured":"A. W. Strsebonski, Computing in the Field of Complex Algebraic Numbers, J. Symbolic Computation 24, pp 647\u2013656, 1997","journal-title":"J. Symbolic Computation"},{"key":"15_CR28","unstructured":"Joris van der Hoeven, Automatic Numerical Expansions, in J.C. Bajard, D. Michelucci, J.M. Moreau, and J.M. Muller, editors, Proc. of the conference \u201cReal numbers and computers\u201d, Saint-Etienne, France, Pages 261\u2013274, 1995"},{"key":"15_CR29","unstructured":"Joris van der Hoeven, Automatic Asymptotics, Ph.D. thesis, Ecole Polytechnique, 1997."},{"key":"15_CR30","unstructured":"Joris van der Hoeven, Zero-testing, witness conjectures and differential diophantine approximation, Preprint"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"R. Zippel, Effective Polynomial Computation, Kluwer Academic Publishers, 1993","DOI":"10.1007\/978-1-4615-3188-3"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T10:01:45Z","timestamp":1737540105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-45335-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}