Euclid's Algorithm for Large Numbers
From MaRDI portal
Cited in
(24)- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
- Complexity questions in number theory
- Quasi-gcd computations
- A modular reduction for GCD computation.
- On the complexity of the Lickteig-Roy subresultant algorithm
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
- Gaussian laws for the main parameters of the Euclid algorithms
- Ergodic computations with continued fractions and Jacobi's algorithm
- Parallelization of triangular decompositions: techniques and implementation
- An algorithm for constructing multidimensional continued fractions and linear dependence of numbers
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- The algorithms of Euclid and Jacobi†
- Multidimensional greatest common divisor and Lehmer algorithms
- A Greatest Common Divisor Algorithm
- Computing special powers in finite fields
- Computation of Continued Fractions Without Input Values
- An extended Jebelean-Weber-Sedjelmaci GCD algorithm
- On Schönhage's algorithm and subquadratic integer gcd computation
- A continued fraction algorithm
- How can we solve a linear Diophantine equation by the basis reduction algorithm
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
- Digitization can stall swarm transport: commensurability locking in quantized-sensing chains
- Optimizing the half-gcd algorithm
- Analysis of Euclidean algorithms for polynomials over finite fields
This page was built for publication: Euclid's Algorithm for Large Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5768438)
