Michael Rothstein2026-03-222026-03-221977https://andeanlibrary.org/handle/123456789/49725Citaciones: 22An algorithm for symbolic integration of functions built up from the rational functions by repeatedly applying either the exponential or logarithm functions is discussed. This algorithm does not require polynomial factorization nor partial fraction decomposition and requires solutions of linear systems with only a small number of unknowns. It is proven that if this algorithm is applied to rational functions over the integers, a computing time bound for the algorithm can be obtained which is a polynomial in a bound on the integer length of the coefficients, and in the degrees of the numerator and denominator of the rational function involved.enLogarithmMathematicsRational functionExponential functionPolynomialPartial fraction decompositionExponential polynomialInteger (computer science)Function (biology)Algorithmarticle