Pages that link to "Item:Q1971066"
From MaRDI portal
The following pages link to New techniques for the computation of linear recurrence coefficients (Q1971066):
Displaying 9 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field (Q1026985) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
- Block diagonalization and LU-equivalence of Hankel matrices (Q2576218) (← links)
- Algebraic diagonals and walks: algorithms, bounds, complexity (Q2628311) (← links)
- A LINEAR COMPLEXITY ANALYSIS OF QUADRATIC RESIDUES AND PRIMITIVE ROOTS SPACINGS (Q5114772) (← links)
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator (Q5432372) (← links)
