Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
From MaRDI portal
Recommendations
Cites work
- 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 4037047 (Why is no real title available?)
- scientific article; zbMATH DE number 3785035 (Why is no real title available?)
- scientific article; zbMATH DE number 3620034 (Why is no real title available?)
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 1074292 (Why is no real title available?)
- scientific article; zbMATH DE number 2151173 (Why is no real title available?)
- scientific article; zbMATH DE number 3011758 (Why is no real title available?)
- scientific article; zbMATH DE number 5485560 (Why is no real title available?)
- scientific article; zbMATH DE number 3244442 (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
- 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 of computation of embedded resolution of algebraic curves
- Differential equations for algebraic functions
- Effective analytic functions
- Factoring polynomials over finite fields: A survey
- Fast Algorithms for Manipulating Formal Power Series
- Fast arithmetic for triangular sets: from theory to practice
- Fast construction of irreducible polynomials over finite fields
- Fast evaluation of holonomic functions
- Fast multiplication of large numbers
- Fast separable factorization and applications
- Good reduction of Puiseux series and applications
- Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications
- Linear differential operators for polynomial equations
- Matrix multiplication via arithmetic progressions
- Modern computer algebra
- Modular composition modulo triangular sets and applications
- On expansion of algebraic functions in power and Puiseux series. I
- On expansion of algebraic functions in power and Puiseux series. II
- On fast multiplication of polynomials over arbitrary algebras
- On the complexity of rational Puiseux expansions
- Puiseux's théorem revisited
- The Computational Complexity of the Resolution of Plane Curve Singularities
- The Magma algebra system. I: The user language
Cited in
(16)- A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
- Computing Puiseux series: a fast divide and conquer algorithm
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
- A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
- Computing the equisingularity type of a pseudo-irreducible polynomial
- Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable
- 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
- Bivariate factorization using a critical fiber
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Polynomial root finding over local rings and application to error correcting codes
- scientific article; zbMATH DE number 4146129 (Why is no real title available?)
- Good reduction of Puiseux series and applications
- Factoring bivariate polynomials using adjoints
- 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: 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)
