A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function

DOI10.1090/S0025-5718-00-01246-1zbMath1042.14039OpenAlexW1991405149MaRDI QIDQ4955867

Peter Gareth Walsh

Publication date: 22 May 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01246-1

Mathematics Subject Classification ID

Computational aspects of algebraic curves (14Q05)

Related Items (16)

A quasi-linear irreducibility test in \(\mathbb{K}x[y\)] ⋮ Generating approximate parametric roots of parametric polynomials ⋮ Polynomial equation solving by lifting procedures for ramified fibers ⋮ Explicit construction of integral bases of radical function fields ⋮ On the complexity of analyticity in semi-definite optimization ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Curves testing boundedness of polynomials on subsets of the real plane ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Good reduction of Puiseux series and applications ⋮ Factoring polynomials over global fields. II. ⋮ Rational solutions of ordinary difference equations ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ Computing all integer solutions of a genus 1 equation ⋮ Computing the equisingularity type of a pseudo-irreducible polynomial ⋮ A Polynomial Time Complexity Bound for Computations on Curves ⋮ A numerical realization of the conditions of Max Nöther's residual intersection theorem

Cites Work

• On expansion of algebraic functions in power and Puiseux series. II
• Factoring polynomials with rational coefficients
• The Eisenstein constant
• Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem
• Factoring Polynomials over Algebraic Number Fields
• Eisenstein's theorem on power series expansions of algebraic functions
• All Algebraic Functions Can Be Computed Fast
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function