Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the complexity of solving ordinary differential equations in terms of
  Puiseux series   We prove that the binary complexity of solving ordinary polynomial
differential equations in terms of Puiseux series is single exponential in the
number of terms in the series. Such a bound was given by Grigoriev [10] for
Riccatti differential polynomials associated to ordinary linear differential
operators. In this paper, we get the same bound for arbitrary differential
polynomials. The algorithm is based on a differential version of the
Newton-Puiseux procedure for algebraic equations.

37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
1
The categories of this paper are: cs
29
The categories of this paper are: funct-an
10
The categories of this paper are: q-bio
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph