Euclid's Algorithm for Large Numbers
From MaRDI portal
Publication:5768438
DOI10.2307/2302607zbMath0018.29204OpenAlexW4253984331WikidataQ56047912 ScholiaQ56047912MaRDI QIDQ5768438
Publication date: 1938
Full work available at URL: https://doi.org/10.2307/2302607
Related Items (22)
An algorithm for constructing multidimensional continued fractions and linear dependence of numbers ⋮ Computing special powers in finite fields ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems ⋮ An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ A modular reduction for GCD computation. ⋮ How can we solve a linear Diophantine equation by the basis reduction algorithm ⋮ A continued fraction algorithm ⋮ The algorithms of Euclid and Jacobi† ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Gaussian laws for the main parameters of the Euclid algorithms ⋮ Computation of Continued Fractions Without Input Values ⋮ On Schönhage's algorithm and subquadratic integer gcd computation ⋮ Multidimensional greatest common divisor and Lehmer algorithms ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders ⋮ A Greatest Common Divisor Algorithm ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms ⋮ Ergodic computations with continued fractions and Jacobi's algorithm ⋮ Complexity questions in number theory ⋮ Quasi-gcd computations
This page was built for publication: Euclid's Algorithm for Large Numbers
