In this article, we will determine Puiseux series solutions of ordinary
polynomial differential equations. We also study the binary complexity of
computing such solutions.
We will prove that this complexity bound is single exponential in the number
of terms in the series. Our algorithm is based on a differential version
of the Newton-Puiseux procedure for algebraic equations