Pages that link to "Item:Q3177879"
From MaRDI portal
The following pages link to Faster Polynomial Multiplication over Finite Fields (Q3177879):
Displayed 19 items.
- Modular composition via factorization (Q722764) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- Fast algorithm of square rooting in some finite fields of odd characteristic (Q1725540) (← links)
- A probabilistic algorithm for verifying polynomial middle product in linear time (Q1799565) (← links)
- Directed evaluation (Q2192677) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Improved method for finding optimal formulas for bilinear maps in a finite field (Q2272384) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- Faster integer multiplication using plain vanilla FFT primes (Q4683179) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- (Q5150372) (← links)
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology (Q6081969) (← links)