Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Caviness, M. Prelle (1978)
A note on algebraic independence of logarithmic and exponential constantsSIGSAM Bull., 12
Chen Li (2001)
Exact Geometric Computation: Theory and Applications
C. Yap (2004)
On guaranteed accuracy computation
D. Richardson (2000)
The Uniformity Conjecture
Chen Li, C. Yap (2001)
A new constructive root bound for algebraic expressions
A. Macintyre, A. Wilkie (1996)
On the decidability of the real exponential field
J. Borwein, P. Borwein (1988)
On the complexity of familiar functions and numbersSiam Review, 30
D. Richardson (2001)
Multiplicative independence of algebraic numbers and expressionsJournal of Pure and Applied Algebra, 164
T. Chow (1998)
What is a Closed-Form Number?American Mathematical Monthly, 106
G. Alefeld, J. Herzberger, J. Rokne (1983)
Introduction to Interval Computation
Alan Baker (1975)
Transcendental Number Theory: Frontmatter
Chen Li, Sylvain Pion, C. Yap (2005)
Recent progress in exact geometric computationJ. Log. Algebraic Methods Program., 64
R. Klein, G. Rote, B. Fu, K. Sugihara, Lutz Kettner, E. Demaine, J. Shewchuk, D. Kirkpatrick, C. Wenk, K. Mehlhorn, D. Halperin, P. Agarwal, B. Speckmann, J. Snoeyink, M. Sharir, Jeff Erickson, William Evans, E. Ramos
Dagstuhl-seminar 01121, ''computational Geometry'' Three-dimensional Mesh Generation for Domains with Small Angles a Separation Bound for Real Algebraic Expressions
C. Yap (1999)
Fundamental problems of algorithmic algebra
K. Weihrauch (2014)
Computable Analysis: An IntroductionComputable Analysis
H. Ferguson, D. Bailey, S. Arno (1999)
Analysis of PSLQ, an integer relation finding algorithmMath. Comput., 68
D. Richardson, Ahmed El-Sonbaty (2006)
Counterexamples to the uniformity conjectureComput. Geom., 33
B. Salvy, J. Shackell (2004)
Symbolic Asymptotics
It would be desirable to have an algorithm to decide equality among the constants which commonly occur in scientific computing. We do not yet know whether or not this is possible. It is known, however, that if the Schanuel conjecture is true, then equality is Turing decidable among the closed form numbers, that is, the complex numbers built up from the rationals using field operations, radicals, exponentials and logarithms. An algorithm based on the Schanuel conjecture is described in this article to decide equality among these numbers, presented as expressions. The algebraic part of this algorithm is simpler than those which have been given previously to solve related problems.
Mathematics in Computer Science – Springer Journals
Published: Oct 23, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.