Daniel Richardson
- B. F. Caviness, On canonical forms and simplification, Journal of the ACM, vol 17, no 2, April 1970, pp 385-396 Google Scholar
Digital Library
- D. Richardson, Some undecidable problems involving elementary functions of a real variable, Journal of Symbolic Logic, 1968, pp 514-520Google Scholar
- J. Ax, Schanuel's Conjecture, Ann Math 93 (1971), 252- 68Google ScholarCross Ref
- A. Baker, Transcendental Number Theory, Cambridge University Press, 1975Google Scholar
- B. F. Caviness and M. J. Prelle, A note on algebraic independence of logarithmic and exponential constants, SIGSAM Bulletin, vol 12, no 2, pp 18-20, 1978 Google ScholarDigital Library
- Cronin, J., Fixed Points and Topological Degree in Nonlinear Analysis, American Mathematical Society, 1964Google Scholar
- Ferguson, H.R.P., and R.W. Forcade, Multidimensional Euclidean Algorithms, J. Reine Ange. Math. 33, (1982), pp 171-181Google Scholar
- N. C. Lloyd, Degree Theory, Cambridge University Press, 1978Google Scholar
- J. Hastad, B. Just, j.C. Lagarias, C. P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, Procedings of STACS '86, Lecture Notes in Computer Science Google ScholarDigital Library
- A. G. Khovanskii, Fewnomials, AMS Translation Mathematical monographs; v 88, AMS, Providence, RI, 1991. (Russian Original: Malochleny, Moscow 1987).Google Scholar
- A.K. Lenstra, H. W. Lenstra, L. Lovasz, Factoring Polynomials with rational coefficients. Math Ann 261, pp 513- 534Google Scholar
- T. Leinekugel, Etre ou ne pas etre zero, report on work done at Bath University in summer 1994Google Scholar
- A.J. Macintyre and A.J. Wilkie, On the decidability of the real exponential field, preprint, Mathematical Institute, Oxford.Google Scholar
- M. Mignotte, Mathematics for Computer Algebra, Springer Verlag, 1991 Google ScholarDigital Library
- M. Pohst, A Modification of the LLL Reduction Algorithm, J. Symbolic Computation (1987) 4, pp 123-127 Google ScholarDigital Library
- P. Rabinowitz (Ed), Numerical Methods for Nonlinear Algebraic Equations, Gordon and Breach, 1970Google Scholar
- D. Richardson, Finding roots of equations involving solutions of first order algebraic differential equations, pp 427- 440 in Effective Methods in Algebraic Geometry, (Teo Mora and Carlo Traverso Eds), Birkhauser 1991Google Scholar
- D. Richardson, Computing the topology of a bounded non-algebraic curve in the plane, Journal of Symbolic Computation, 14, 1992, pp 619-643 Google ScholarDigital Library
- D. Richardson, The Elementary Constant Problem, IS- SAC 92. Google ScholarDigital Library
- D. Richardson, A zero structure theorem for exponential systems, ISSAC '93 Google ScholarDigital Library
- D. Richardson and J. P. Fitch, Simplification of Elementary Constants and Functions, ISSAC '94Google Scholar
- M. Rosenlicht, On Liouville's Theory of Elementary Functions, Pacific Journal of Mathematics, voI 65, no 2, 1976, pp 485-492Google Scholar
- B. Salvy, Asymptotique Automatique et Fonctions G~nratrices, Thesis, Ecole Polytechnique, 1991Google Scholar
- J. Shackell, Zero-Equivalence in function fields defined by algebraic differential equations, Trans. of the AMS, vol 336, Number 1, pp 151-171, 1993Google Scholar
- J. Shackell, A Differential equations approach to functional equivalence, in C. Gonnet, editor, ISSAC '89 Proceedings, pp 7-10, ACM press, Portalnd Oregon, 1989 Google Scholar
- N. N. Vorobjov, Deciding consistency of systems of polynomial in exponent inequalities in subexponential time, Proceedings of MEGA 90, 1990.Google Scholar
- S.C. Chou, W. F. Schelter, and J. G. Yang, Characteristic Sets and GrSbner Bases in Geometry Theorem Proving, Draft, Institute for Computing Science, The University of Texas, Austin, TX 78712Google Scholar
- W. T. Wu, Basic Principles of Mechanical Theorem Proving in Elementary Geometries, J. Sys. Sci. and Math. Scis, f(3), 1984, 207-235Google Scholar
Index Terms
A simplified method of recognizing zero among elementary constants
Comments