@inproceedings{b52b6438ee174f34bb20583bdc628de6,
title = "Solving analytic differential equations in polynomial time over unbounded domains",
abstract = "In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of ℝn and ℂn, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane.",
author = "Olivier Bournez and Gra{\c c}a, \{Daniel S.\} and Amaury Pouly",
year = "2011",
month = sep,
day = "1",
doi = "10.1007/978-3-642-22993-0\_18",
language = "English",
isbn = "9783642229923",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "170--181",
booktitle = "Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings",
note = "36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011 ; Conference date: 22-08-2011 Through 26-08-2011",
}