Displaying similar documents to “Puiseux series solutions of ordinary polynomial differential equations: complexity study.”

Factoring polynomials over global fields

Karim Belabas, Mark van Hoeij, Jürgen Klüners, Allan Steel (2009)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We prove that van Hoeij’s original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well as natural variants. In particular, our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.

On the computation of the GCD of 2-D polynomials

Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.