scientific article; zbMATH DE number 3581610

zbMath0373.68040MaRDI QIDQ4151157

Richard P. Brent

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

continuous modelexpected number of iterationsbinary Euclidean algorithmproblem: existence of the limiting distribution

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Limit theorems in probability theory (60F99)

Related Items (11)

A systolic algorithm for extended GCD computation ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Probabilistic analyses of the plain multiple gcd algorithm ⋮ A rigorous version of R. P. Brent's model for the binary Euclidean algorithm ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ Existence of a limiting distribution for the binary GCD algorithm ⋮ Computing GCD's by normalized division ⋮ On the complexity of real root isolation using continued fractions ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms

This page was built for publication: