In this paper we consider the computational complexity of solving initial-value problems de ned with analytic ordinary diferential
equations (ODEs) over unbounded domains of Rn and Cn, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of de nition, provided it satis es a very generous bound on its growth, and that the function admits an analytic extension to the complex plane
