𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamical analysis of a class of Euclidean algorithms

✍ Scribed by Brigitte Vallée

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
538 KB
Volume
297
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of dynamic rough partitive algor
A class of dynamic rough partitive algorithms
✍ Georg Peters; Richard Weber 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

Partitive algorithms, like cluster algorithms, are frequently used methods in data mining. Most of them are static in the sense that they detect pattern in stable data structures, i.e. the data structure remains unchanged over time. However, many real-life situations are characterized by changing da

On the asymptotic analysis of the Euclid
On the asymptotic analysis of the Euclidean algorithm
✍ G.H. Norton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Let N > 2 and 8 > 0. For uniformly distributed integers in the interval I-1, N], the Euclidean algorithm requires an average of 121n2( 1 divisions, where C is Porter's constant.