A differential-equations approach to functional equivalence
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Analysis of constructed mathematical responses by numeric tests for equivalence
ACM '69 Proceedings of the 1969 24th national conference
A note on algebraic independence of logarithmic and exponential constants
ACM SIGSAM Bulletin
Towards computing non algebraic cylindrical decompositions
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Asymptotic expansions of functional inverses
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Nested expansions and hardy fields
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
A new algorithm for computing asymptotic series
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Star products and the representation of asymptotic growth
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
ACM SIGSAM Bulletin
Journal of Symbolic Computation
Journal of Symbolic Computation
| Hi-index | 0.00 |
Exp-log functions are those obtained from the constant 1 and the variable X by means of arithmetic operations and the function symbols exp() and log@?. This paper gives an explicit algorithm for determining eventual dominance of these functions modulo an oracle for deciding zero equivalence of constant terms, This also provides another proof that the dominance problem for exp-log functions is Turing-reducible to the identity problem for constant terms.