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-1zbMATH Open1042.14039OpenAlexW1991405149MaRDI QIDQ4955867FDOQ4955867

Authors: P. G. 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

Recommendations

• scientific article; zbMATH DE number 5154
• Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
• scientific article; zbMATH DE number 4037047
• Computing Puiseux series: a fast divide and conquer algorithm
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

Mathematics Subject Classification ID

Computational aspects of algebraic curves (14Q05)

Cites Work

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

Cited In (18)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955867)