Quasi-GCD computations
Arnold Schönhage · Journal of Complexity · 1985
Cited by 126 works. doi:10.1016/0885-064x(85)90024-x Open-access PDF
Authors
References
- The Art of Computer Programming
- The Design and Analysis of Computer Algorithms
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- The Analysis of Algorithms
- Schnelle Berechnung von Kettenbruchentwicklungen
- Fast computation of GCDs
- The Computational Complexity of Continued Fractions
- Euclid's Algorithm for Large Numbers
- Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation