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 6 items.
- 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)
