The Accelerated Euclidean Algorithm
Data Structures and Algorithms
2007-05-23 v1
Authors:
Sidi Mohamed Sedjelmaci
Abstract
We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still O(nlog2n loglogn) for n-bit inputs.
Cite
@article{arxiv.cs/0412006,
title = {The Accelerated Euclidean Algorithm},
author = {Sidi Mohamed Sedjelmaci},
journal= {arXiv preprint arXiv:cs/0412006},
year = {2007}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
GCD Computation of n Integers
Shri Prakash Dwivedi
2014-08-19
Emerging Technologies · Computer Science
Quantum Circuits for GCD Computation with $O(n \log n)$ Depth and O(n) Ancillae
Mehdi Saeedi, Igor L. Markov
2013-04-30
Commutative Algebra · Mathematics
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials
Akira Terui
2016-05-12
Commutative Algebra · Mathematics
GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
Akira Terui
2015-05-19
Number Theory · Mathematics
Multiplication of polynomials over the binary field
Chunlei Liu
2025-05-15
Symbolic Computation · Computer Science
Simple algorithm for GCD of polynomials
Pasquale Nardone, Giorgio Sonnino
2022-01-19
Commutative Algebra · Mathematics
GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients
Akira Terui
2010-07-13
Computational Complexity · Computer Science
Optimizing the half-gcd algorithm
Joris van der Hoeven
2022-12-26
Symbolic Computation · Computer Science
Fast Integer Multiplication using Modular Arithmetic
Anindya De, Piyush P Kurur, Chandan Saha, Ramprasad Saptharishi
2008-09-19
Data Structures and Algorithms · Computer Science
A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM
Jonathan P. Sorenson
2010-01-15
Symbolic Computation · Computer Science
Bit Complexity of Polynomial GCD on Sparse Representation
Qiao-Long Huang, Xiao-Shan Gao
2022-07-29
Distributed, Parallel, and Cluster Computing · Computer Science
Improvements on the accelerated integer GCD algorithm
Sidi Mohamed Sedjelmaci, Christian Lavault
2014-02-11
Commutative Algebra · Mathematics
The GPGCD Algorithm with the B\'ezout Matrix for Multiple Univariate Polynomials
Boming Chi, Akira Terui
2022-05-09
Quantum Physics · Physics
A quantum algorithm for greatest common divisor problem
Wen Wang, Xu Jiang, Liang-zhu Mu, Heng Fan
2017-08-02
Hardware Architecture · Computer Science
Area-Delay-Efficeint FPGA Design of 32-bit Euclid's GCD based on Sum of Absolute Difference
Saeideh Nabipour, Masoume Gholizade, Nima Nabipour
2022-11-18
Computational Geometry · Computer Science
Computing the Center Region and Its Variants
Eunjin Oh, Hee-Kap Ahn
2019-10-29
Information Theory · Computer Science
Efficient Decoding of Gabidulin Codes over Galois Rings
Sven Puchinger, Julian Renner, Antonia Wachter-Zeh, Jens Zumbrägel
2021-02-04
Symbolic Computation · Computer Science
Faster integer and polynomial multiplication using cyclotomic coefficient rings
David Harvey, Joris van der Hoeven
2017-12-12
Data Structures and Algorithms · Computer Science
Some linear-time algorithms for systolic arrays
Richard P. Brent, Franklin T. Luk, H. T. Kung
2010-04-22
Discrete Mathematics · Computer Science
Analysis of the Continued Logarithm Algorithm
Pablo Rotondo, Brigitte Vallee, Alfredo Viola
2018-02-02
Data Structures and Algorithms · Computer Science
An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. Brent, Paul Zimmermann
2010-11-29
Computational Geometry · Computer Science
Efficient Planar Two-Center Algorithms
Jongmin Choi, Hee-Kap Ahn
2020-07-09
Information Theory · Computer Science
The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes
Sabine Kampf, Martin Bossert
2010-10-19
Data Structures and Algorithms · Computer Science
Improved Algorithms for Integer Complexity
Qizheng He
2023-09-14
Symbolic Computation · Computer Science
Faster truncated integer multiplication
David Harvey
2023-08-03