Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,227,122 papers from all fields of science
Search
Sign In
Create Free Account
Euclidean algorithm
Known as:
Euclids algorithm
, Game of Euclid
, Euclidean
Expand
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ARM architecture
Algorithm
BCH code
Berlekamp–Massey algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
3-dimensional Continued Fraction Algorithms Cheat Sheets
S. Labbé
arXiv.org
2015
Corpus ID: 33477742
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or…
Expand
2013
2013
Implementation of accelerated BCH decoders on GPU
Xiaoxia Qi
,
Xiao Ma
,
Dou Li
,
Yuping Zhao
International Conference on Wireless…
2013
Corpus ID: 6348335
With the development of communication systems, the requirement for efficient error correcting code becomes an important issue. In…
Expand
2009
2009
Computations modulo regular chains
Xin Li
,
M. M. Maza
,
Wei Pan
International Symposium on Symbolic and Algebraic…
2009
Corpus ID: 14666322
The computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and…
Expand
Highly Cited
2007
Highly Cited
2007
A High-Speed Pipelined Degree-Computationless Modified Euclidean Algorithm Architecture for Reed-Solomon Decoders
Seungbeom Lee
,
Hanho Lee
IEEE International Symposium on Circuits and…
2007
Corpus ID: 3916583
This paper presents a novel high-speed low-complexity pipelined degree-computationless modified Euclidean (pDCME) algorithm…
Expand
2005
2005
On the Complexity of a Grobner Basis Algorithm
M. Bardet
2005
Corpus ID: 16133635
While the computation of Grobner bases is known to be an expspace-complete problem, the generic behaviour of algorithms for their…
Expand
2004
2004
Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm
B. Daireaux
,
B. Vallée
Combinatorics, probability & computing
2004
Corpus ID: 10541465
The Lehmer–Euclid Algorithm is an improvement of the Euclid Algorithm when applied to large integers. The original Lehmer–Euclid…
Expand
2003
2003
An area-efficient Euclidean algorithm block for Reed-Solomon decoder
Hanho Lee
IEEE Computer Society Annual Symposium on VLSI…
2003
Corpus ID: 18588650
This paper presents a new area-efficient architecture to implement the Euclidean algorithm, which is frequently used in Reed…
Expand
1998
1998
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
Ruben Gamboa
IPPS/SPDP Workshops
1998
Corpus ID: 8548450
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In…
Expand
1998
1998
The Complete Analysis of the Binary Euclidean Algorithm
B. Vallée
International Workshop on Ant Colony Optimization…
1998
Corpus ID: 11260365
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose…
Expand
1987
1987
Accelerated branch exchange heuristics for symmetric traveling salesman problems
W. Stewart
Networks
1987
Corpus ID: 45885866
A method for accelerating the computational performance of branch exchange heuristics for symmetric traveling salesman problems…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE