Skip to Main content Skip to Navigation
Journal articles

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

Adrien Poteaux 1, 2 Marc Rybowicz 3
1 SALSA - Solvers for Algebraic Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
3 DMI
XLIM - XLIM
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00601438
Contributor : Yolande Vieceli <>
Submitted on : Friday, June 17, 2011 - 4:50:17 PM
Last modification on : Friday, January 8, 2021 - 5:50:04 PM

Links full text

Identifiers

Citation

Adrien Poteaux, Marc Rybowicz. Complexity bounds for the rational Newton-Puiseux algorithm over finite fields. Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2011, 22 (3), pp.187-217. ⟨10.1007/s00200-011-0144-6⟩. ⟨hal-00601438⟩

Share

Metrics

Record views

366