scientific article; zbMATH DE number 4037047

MaRDI QIDQ3776501zbMATH OpenFDO

Authors A. L. Chistov

Publication date 1986

zbMATH Keywords

fraction-power seriesNewton-Puiseux algorithmpolynomial complexity

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 5154
• Puiseux series solutions of ODEs
• scientific article; zbMATH DE number 953020
• Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic
• Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields

Cited in

(23)

• On computation of a power series root with arbitrary degree of convergence
• On the complexity of rational Puiseux expansions
• Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
• Computing tropical points and tropical links
• Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic
• Complexity of deciding whether a tropical linear prevariety is a tropical variety
• On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic
• Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic
• A numerical realization of the conditions of Max Nöther's residual intersection theorem
• An overview of effective normalization of a projective algebraic variety nonsingular in codimension one
• Improving complexity bounds for the computation of Puiseux series over finite fields
• Dynamic Newton-Puiseux theorem
• Generating approximate parametric roots of parametric polynomials
• Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• scientific article; zbMATH DE number 5154 (Why is no real title available?)
• scientific article; zbMATH DE number 953020 (Why is no real title available?)
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• Irreducibility testing over local fields
• Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I
• Good reduction of Puiseux series and applications
• Plane curve germs and contact factorization
• Complexity of factoring and calculating the GCD of linear ordinary differential operators

This page was built for publication:

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