Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields

Adrien Poteaux
Marc Rybowicz
  • Function : Author
  • PersonId : 974494
DMI

Abstract

Let L be a field of characteristic p with q elements and F ∈ L[X, Y ] be a polynomial with p > deg Y (F) and total degree d. In [40], we showed that rational Puiseux series of F above X = 0 could be computed with an expected number of O˜d 3 log q) arithmetic operations in L. In this paper, we reduce this bound to O˜og q) using Hensel lifting and changes of variables in the Newton-Puiseux algorithm that give a better control of the number of steps. The only asymptotically fast algorithm required is polynomial multiplication over finite fields. This approach also allows to test the irreducibility of F in L[[X]][Y ] with Oõperations in L. Finally, we describe a method based on structured bivariate multiplication [34] that may speed up computations for some input.
Fichier principal
Vignette du fichier
puiseuxd4.pdf (279.22 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01253216 , version 1 (08-01-2016)

Identifiers

Cite

Adrien Poteaux, Marc Rybowicz. Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields. ISSAC '15, Jul 2015, Bath, United Kingdom. pp.299--306, ⟨10.1145/2755996.2756650⟩. ⟨hal-01253216⟩
197 View
220 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More