Optimizing the half-gcd algorithm
From MaRDI portal
Cites work
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Algebraic coding theory
- Algorithmic Number Theory
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Computing one billion roots using the tangent Graeffe method
- Euclid's Algorithm for Large Numbers
- Fast computation of continued fraction expansions.
- Fast computation of GCDs
- Fast multiplication and its applications
- Fast multiplication of polynomials over fields of characteristic 2
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Faster algorithms for the square root and reciprocal of power series
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Gaussian elimination is not optimal
- Half-GCD and fast rational recovery
- scientific article; zbMATH DE number 3765129 (Why is no real title available?)
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 3440002 (Why is no real title available?)
- Implementing the thull-yap algorithm for computing Euclidean remainder sequences
- Modern computer algebra
- On fast multiplication of polynomials over arbitrary algebras
- On Schönhage's algorithm and subquadratic integer gcd computation
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Polynomial multiplication over finite fields in time O(n n)
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Shift-register synthesis and BCH decoding
- The middle product algorithm. I: Speeding up the division and square root of power series
- The truncated fourier transform and applications
This page was built for publication: Optimizing the half-gcd algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287163)
