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

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

Cites work

All Algebraic Functions Can Be Computed Fast
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
Factoring Polynomials over Algebraic Number Fields
Factoring polynomials with rational coefficients
scientific article; zbMATH DE number 3858405 (Why is no real title available?)
scientific article; zbMATH DE number 4146129 (Why is no real title available?)
scientific article; zbMATH DE number 3951430 (Why is no real title available?)
scientific article; zbMATH DE number 4037047 (Why is no real title available?)
scientific article; zbMATH DE number 3785004 (Why is no real title available?)
scientific article; zbMATH DE number 1273655 (Why is no real title available?)
scientific article; zbMATH DE number 3011758 (Why is no real title available?)
scientific article; zbMATH DE number 3303655 (Why is no real title available?)
scientific article; zbMATH DE number 3342122 (Why is no real title available?)
scientific article; zbMATH DE number 3059981 (Why is no real title available?)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
On expansion of algebraic functions in power and Puiseux series. II
The Eisenstein constant

Cited in

(24)

An algorithm for computing the values of the ramification index in the Puiseux series expansions of an algebraic function
On the complexity of rational Puiseux expansions
Computing the equisingularity type of a pseudo-irreducible polynomial
Computing Puiseux series: a fast divide and conquer algorithm
[[:Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
A numerical realization of the conditions of Max Nöther's residual intersection theorem
Curves testing boundedness of polynomials on subsets of the real plane
Polynomial root finding over local rings and application to error correcting codes
Factoring polynomials over global fields. II.
Generating approximate parametric roots of parametric polynomials
A Polynomial Time Complexity Bound for Computations on Curves
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
Computing all integer solutions of a genus 1 equation
scientific article; zbMATH DE number 5154 (Why is no real title available?)
scientific article; zbMATH DE number 953020 (Why is no real title available?)
Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
Polynomial equation solving by lifting procedures for ramified fibers
On the complexity of analyticity in semi-definite optimization
Explicit construction of integral bases of radical function fields
Good reduction of Puiseux series and applications
The Newton-Puiseux algorithm and effective algebraic series
Plane curve germs and contact factorization
Validated numerical Hensel lifting
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)