𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Euclidean algorithms are Gaussian

✍ Scribed by Viviane Baladi; Brigitte Vallée

Book ID
104024505
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
583 KB
Volume
110
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fast Euclidean Algorithm for Gaussian
A Fast Euclidean Algorithm for Gaussian Integers
✍ George E. Collins 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A new version of the Euclidean algorithm is developed for computing the greatest common divisor of two Gaussian integers. It uses approximation to obtain a sequence of remainders of decreasing absolute values. The algorithm is compared with the new (1+i)ary algorithm of Weilert and found to be somew

New fast euclidean algorithms
New fast euclidean algorithms
✍ Marie-Françoise Roy; Sidi Mohamed Sedjelmaci 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 239 KB
Approximation Algorithms || Euclidean TS
Approximation Algorithms || Euclidean TSP
✍ Vazirani, Vijay V. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 773 KB

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con­ jecture that P -=/= NP, their

Binary Euclidean algorithm
Binary Euclidean algorithm
✍ R. P Brent 📂 Library 📅 1976 🏛 Department of Computer Science, Carnegie-Mellon Un 🌐 English ⚖ 109 KB