Computing Puiseux series: a fast divide and conquer algorithm
From MaRDI portal
Publication:2077183
DOI10.5802/ahl.97zbMath1481.14093arXiv1708.09067OpenAlexW3199833776MaRDI QIDQ2077183
Martin Weimann, Adrien Poteaux
Publication date: 24 February 2022
Published in: Annales Henri Lebesgue (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09067
Analysis of algorithms and problem complexity (68Q25) Singularities in algebraic geometry (14B05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Singularities of curves, local rings (14H20)
Related Items (2)
A quasi-linear irreducibility test in \(\mathbb{K}x[y\)] ⋮ Computing Riemann-Roch spaces via Puiseux expansions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular composition modulo triangular sets and applications
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Good reduction of Puiseux series and applications
- EUROCAL '85. European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985. Proceedings. Vol. 2: Research contributions
- On fast multiplication of polynomials over arbitrary algebras
- Fast rectangular matrix multiplication and applications
- Solving multivariate algebraic equation by Hensel construction
- Bivariate factorization using a critical fiber
- Irreducibility criterion for germs of analytic functions of two complex variables
- Linear differential operators for polynomial equations
- On the complexity of computing with zero-dimensional triangular sets
- Directed evaluation
- Accelerated tower arithmetic
- Variations on inversion theorems for Newton-Puiseux series
- Fast multiplication of large numbers
- Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
- Modern Computer Algebra
- On the Concavity of the Arithmetic Volumes
- Change of order for bivariate triangular sets
- A Fast Algorithm for Computing the Truncated Resultant
- Powers of tensors and fast matrix multiplication
- Greatest common divisors of polynomials given by straight-line programs
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Multivariate Polynomial Factorization
- All Algebraic Functions Can Be Computed Fast
- On the Extended Hensel Construction and its Application to the Computation of Limit Points
- Death of Marc Rybowicz, aged 52
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- Fast construction of irreducible polynomials over finite fields
This page was built for publication: Computing Puiseux series: a fast divide and conquer algorithm
