Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
From MaRDI portal
Publication:5301629
DOI10.1145/1390768.1390802zbMath1489.13043OpenAlexW2019223056MaRDI QIDQ5301629
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1390768.1390802
Symbolic computation and algebraic computation (68W30) Plane and space curves (14H50) Computational aspects of algebraic curves (14Q05) Polynomials, factorization in commutative rings (13P05)
Related Items (4)
Curves testing boundedness of polynomials on subsets of the real plane ⋮ Good reduction of Puiseux series and applications ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ Computing Puiseux series: a fast divide and conquer algorithm
This page was built for publication: Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
