Good reduction of Puiseux series and applications
From MaRDI portal
(Redirected from Publication:654032)
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 4146129 (Why is no real title available?)
- scientific article; zbMATH DE number 3944020 (Why is no real title available?)
- scientific article; zbMATH DE number 3745550 (Why is no real title available?)
- scientific article; zbMATH DE number 1482142 (Why is no real title available?)
- scientific article; zbMATH DE number 747049 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- scientific article; zbMATH DE number 3227195 (Why is no real title available?)
- scientific article; zbMATH DE number 3238783 (Why is no real title available?)
- scientific article; zbMATH DE number 3244442 (Why is no real title available?)
- scientific article; zbMATH DE number 3059981 (Why is no real title available?)
- scientific article; zbMATH DE number 3070524 (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
- Absolute Factorization of Polynomials: A Geometric Approach
- Algebroid curves in positive characteristic
- All Algebraic Functions Can Be Computed Fast
- An algorithm for computing an integral basis in an algebraic function field
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Complexity of computation of embedded resolution of algebraic curves
- Computing GCDs of polynomials over algebraic number fields
- Computing Riemann matrices of algebraic curves
- Computing the Abel map
- Differential equations for algebraic functions
- Effective analytic functions
- Factoring Polynomials Over Algebraic Number Fields
- Fast evaluation of holonomic functions
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications
- Hurwitz schemes and irreducibility of moduli of algebraic curves
- Integration of elementary functions
- Modern computer algebra
- On Natural Radii of p-Adic Convergence
- On expansion of algebraic functions in power and Puiseux series. I
- On expansion of algebraic functions in power and Puiseux series. II
- On the complexity of rational Puiseux expansions
- Puiseux's théorem revisited
- Rational parametrizations of algebraic curves using a canonical divisor
- The Magma algebra system. I: The user language
Cited in
(13)- The method of Gauss-Newton to compute power series solutions of polynomial homotopies
- The practical Gauss type rules for Hadamard finite-part integrals using Puiseux expansions
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- The high order augmented finite volume methods based on series expansion for nonlinear degenerate parabolic equations
- Computing Puiseux series: a fast divide and conquer algorithm
- Fractional Hermite interpolation for non-smooth functions
- The modified composite Gauss type rules for singular integrals using Puiseux expansions
- Series misdemeanors
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- Improving complexity bounds for the computation of Puiseux series over finite fields
- An algorithm for the inversion of Laplace transforms using Puiseux expansions
- Computing monodromy via continuation methods on random Riemann surfaces
- [[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
This page was built for publication: Good reduction of Puiseux series and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654032)
