The following pages link to Accelerated tower arithmetic (Q2338646):
Displaying 9 items.
- Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Directed evaluation (Q2192677) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
