Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

Symbolic computation and algebraic computation (68W30) Plane and space curves (14H50) Polynomials, factorization in commutative rings (13P05) Computational aspects of algebraic curves (14Q05)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The Magma algebra system. I: The user language
On fast multiplication of polynomials over arbitrary algebras
Fast multiplication of large numbers
Matrix multiplication via arithmetic progressions
Modular composition modulo triangular sets and applications
Fast Algorithms for Manipulating Formal Power Series
Calcul pratique des coefficients de Taylor d'une fonction algébrique
Fast separable factorization and applications
Modern computer algebra
Factoring polynomials over finite fields: A survey
On expansion of algebraic functions in power and Puiseux series. I
All Algebraic Functions Can Be Computed Fast
A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
Complexity of computation of embedded resolution of algebraic curves
Fast construction of irreducible polynomials over finite fields
An algorithm for computing an integral basis in an algebraic function field
On expansion of algebraic functions in power and Puiseux series. II
Fast evaluation of holonomic functions
On the complexity of rational Puiseux expansions
Linear differential operators for polynomial equations
Effective analytic functions
The Computational Complexity of the Resolution of Plane Curve Singularities
Hensel construction of F(x, u ₁ , ..., x _l ) l ≥ 2 at a singular point and its applications
Good reduction of Puiseux series and applications
Puiseux's théorem revisited

Cited In (13)

Factoring bivariate polynomials using adjoints
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays
Good reduction of Puiseux series and applications
Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable
Computing the equisingularity type of a pseudo-irreducible polynomial
Polynomial root finding over local rings and application to error correcting codes
[[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
Computing monodromy via continuation methods on random Riemann surfaces
Bivariate factorization using a critical fiber
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
Computing Puiseux series: a fast divide and conquer algorithm

Uses Software

Magma
Maple

This page was built for publication: Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

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