Polynomial time algorithms for finding integer relations among real numbers
SIAM Journal on Computing
Algorithmic algebraic number theory
Algorithmic algebraic number theory
Mathematics for computer algebra
Mathematics for computer algebra
Real algebraic number computation using interval arithmetic
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Complexity and real computation
Complexity and real computation
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Computing in the field of complex algebraic numbers
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
On validated computing in algebraic number fields
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
A weak version of the Blum, Shub and Smale model
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A new zero-test for formal power series
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Some observations on familiar numbers
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Use of algebraically independent numbers for zero recognition of polynomial terms
Journal of Complexity
Counterexamples to the uniformity conjecture
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Counterexamples to the uniformity conjecture
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
| Hi-index | 0.00 |
This paper discusses the relationship between the syntactic length of expressions built up from the integers using field operations, radicals and exponentials and logarithms, and the smallness of non zero complex numbers defined by such expressions. The Uniformity Conjecture claims that if the expressions are written in an expanded form in which all the arguments of the exponential function have absolute value bounded by 1, then a small multiple of the syntactic length gives a bound for the number of decimal places needed to distinguish the defined number from zero. The consequences of this conjecture are compared with some known results about closeness of approximation from Liouville, Baker, Waldschmidt, Thue-Siegel-Roth. A few of many practical computational consequences are stated. Also the problem of searching for a possible counterexample to the Uniformity Conjecture is discussed and some preliminary results are given.