A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
From MaRDI portal
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
- 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?)
- 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
- 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
(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
- Rational solutions of ordinary difference equations
- On the complexity of analyticity in semi-definite optimization
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)
