Pages that link to "Item:Q2077183"
From MaRDI portal
The following pages link to Computing Puiseux series: a fast divide and conquer algorithm (Q2077183):
Displaying 10 items.
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Good reduction of Puiseux series and applications (Q654032) (← links)
- An algorithm for computing the values of the ramification index in the Puiseux series expansions of an algebraic function (Q1061175) (← links)
- On the complexity of rational Puiseux expansions (Q1305098) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Improving complexity bounds for the computation of Puiseux series over finite fields (Q2819772) (← links)
- Dynamic Newton–Puiseux theorem (Q2930867) (← links)
- Puiseux Expansion of a Cuspidal Singularity (Q3115399) (← links)
- Rationality and parametrizations of algebraic curves under specializations (Q6612183) (← links)
