Pages that link to "Item:Q300881"
From MaRDI portal
The following pages link to Deterministic root finding over finite fields using Graeffe transforms (Q300881):
Displaying 8 items.
- Modular composition via factorization (Q722764) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
- Counting roots for polynomials modulo prime powers (Q6165864) (← links)
