Average bit-complexity of Euclidean algorithms
From MaRDI portal
Recommendations
Cited in
(14)- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
- Dynamical analysis of a class of Euclidean algorithms.
- Euclidean algorithms are Gaussian
- Gaussian laws for the main parameters of the Euclid algorithms
- Euclidean dynamics
- scientific article; zbMATH DE number 1346365 (Why is no real title available?)
- A unifying framework for the analysis of a class of Euclidean algorithms
- Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm
- Dynamical analysis of α-Euclidean algorithms
- A binary algorithm with low divergence for modular inversion on SIMD architectures
- Analysis of fast versions of the Euclid algorithm
- Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
- Analysis of Euclidean algorithms for polynomials over finite fields
This page was built for publication: Average bit-complexity of Euclidean algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754158)