✦ LIBER ✦

New fast euclidean algorithms

✍ Scribed by Marie-Françoise Roy; Sidi Mohamed Sedjelmaci

Book ID: 118480758
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 239 KB
Volume: 50
Category: Article
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2012.06.003

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 Euclidean algorithm for GCD

✍ Bradley. 📂 Library 📅 1970 🏛 CACM 🌐 English ⚖ 157 KB

The non-Euclidean Euclidean algorithm

✍ Gilman, Jane 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Euclidean algorithms are Gaussian

✍ Viviane Baladi; Brigitte Vallée 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 583 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

An ARMA spectral analysis technique base

An ARMA spectral analysis technique based on a fast Euclidean algorithm

✍ Palmer, R.D.; Cruz, J.R. 📂 Article 📅 1989 🏛 IEEE ⚖ 437 KB