The uniformity conjecture

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2064, Issue , 2001, Pages 253-272

  Richardson, Daniel ^a  

^a UNIVERSITY OF BATH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; SYNTACTICS;

ABSOLUTE VALUES; COMPLEX NUMBER; COMPUTATIONAL CONSEQUENCES; EXPONENTIALS; FIELD OPERATION; LIOUVILLE; SMALL MULTIPLES;

EXPONENTIAL FUNCTIONS;

EID: 84974661264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45335-0_15     Document Type: Conference Paper

References (30)

1. A. Baker, Transcendental number theory, CUP, 1975
2. 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-601
3. Blum, Cucker, Shub, Smale, Real Complexity and Computation, Springer
4. T.Y. Chow, What is a Closed-Form Number?, American Mathematical Monthly, Vol 106, No 5, 1999, pp 440-448
5. J. Davenport, Y. Siret, and E. Tournier, Computer Algebra, Academic Press, 1993.
6. B.M.M. DeWeger, Solving exponential Diophantine equations using lattice basis reduction algorithms, J. Number Theory 26 (1987) 325-367.
7. J. Håstad, 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-881.
8. M. Hindry and J. Silverman, Diophantine Geometry, An Introduction, Springer Graduate Texts in Mathematics, 2000
9. E. Hlawka, J. Schoissengeier, and R. Taschner, Geometric and Analytic Number Theory. Springer Verlag, 1991
10. Namhyun Hur and James H. Davenport, An exact Real Arithmetic with Equality Determination, draft, (Bath U)
11. J.R. Johnson, Real Algebraic Number Computation using Interval Arithmetic, ISSAC '92, pp 195-205
12. P. Koiran, A weak version of the Blum, Shub and Smale Model, FOCS '93, pp 486-495; also in JCSS 54 (1), pp 177-189, 1997
13. S. Langley and D. Richardson, Bounds on Algebraic Expressions, preprint [Lang] S. Lang, Introduction to Transcendental Numbers, Addison Wesley, 1966
14. R. Loos, Computing in Algebraic Extensions, Computing, 4, (Suppl) pp 173-187, 1982
15. Martin Sombra, Estimaciones para el Teorema de Ceros de Hilbert, Tesis, Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, 1998.
16. P. Philippon, Sur des hauteurs alternatives, I, Math Ann. 289 (1991), pp 255-283; II Ann. Inst. Fourier 44 (1994), pp 1043-1065; III, J. Math. Pures Appl. 74 (1995), pp 345-365
17. P. Philippon, Quelques remarques sur des questions d’approximation diophantine, Bull Austral. Math. Soc., Vol 59(2), (1999), pp 323-334.
18. P. Philippon, Addendum a quelques remarques sur des questions d’approximation diophantine, Bull Austral. Math. Soc., vol 61(1), (2000), pp 167-169.
19. M. Pohst, Algorithmic Algebraic Number Theory
20. M. Pohst, On Validated Computing in Algebraic Number Fields, J. Symbolic Computation 24, pp 657-666, 1997
21. 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-467.
22. M. Mignotte, Mathematics for Computer Algebra, Springer Verlag, 1991
23. D. Richardson, How to Recognise Zero, J. Symbolic Computation (1997), 24, pp 627-645
24. D. Richardson, Multiplicative Independence of Algebraic Numbers and Expressions, Mega2000 conference Bath June 2000, to appear in Journal of Pure and Applied Algebra.
25. V.G. Sprindzhuk, Achievements and Problems in Diophantine Approximation Theory, Russian Mathematical Surveys 35 (4), 1980, pp 1-80
26. A. W. Strsebonski, Computing in the Field of Complex Algebraic Numbers, J. Symbolic Computation 24, pp 647-656, 1997
27. 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 "Real numbers and computers", Saint-Etienne, France, Pages 261-274, 1995
28. Joris van der Hoeven, Automatic Asymptotics, Ph.D. thesis, Ecole Polytechnique, 1997.
29. Joris van der Hoeven, Zero-testing, witness conjectures and differential diophantine approximation, Preprint
30. R. Zippel, Effective Polynomial Computation, Kluwer Academic Publishers, 1993