Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields

Adrien Poteaux, Marc Rybowicz. Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields. In J. Rafael Sendra, Laureano González-Vega, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings. pages 239-246, ACM, 2008. [doi]

Abstract

Abstract is missing.