On the complexity of rational Puiseux expansions
From MaRDI portal
Publication:1305098
DOI10.2140/pjm.1999.188.369zbMath0963.14034OpenAlexW2058272230MaRDI QIDQ1305098
Publication date: 23 August 2000
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1999.188.369
Analysis of algorithms and problem complexity (68Q25) Computational aspects of algebraic curves (14Q05) Polynomials (irreducibility, etc.) (11R09) Singularities of curves, local rings (14H20)
Related Items (6)
Polynomial equation solving by lifting procedures for ramified fibers ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Good reduction of Puiseux series and applications ⋮ Two-time-scale distributions and singular perturbations ⋮ Computing all integer solutions of a genus 1 equation
This page was built for publication: On the complexity of rational Puiseux expansions
