Pages that link to "Item:Q2819772"
From MaRDI portal
The following pages link to Improving complexity bounds for the computation of Puiseux series over finite fields (Q2819772):
Displaying 10 items.
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Bivariate factorization using a critical fiber (Q1683738) (← links)
- Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- On the extended Hensel construction and its application to the computation of real limit points (Q2284954) (← links)
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field (Q2985816) (← links)
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (Q5301629) (← links)
